Step 1: Select green toys.
There are \(5\) different green toys.
The number of ways to choose any subset of these toys is
\[
2^5=32
\]
But at least one green toy must be selected, so exclude the empty selection:
\[
32-1=31
\]
Thus, the number of ways to choose green toys is
\[
31
\]
Step 2: Select blue toys.
There are \(4\) different blue toys.
Total subsets:
\[
2^4=16
\]
Since at least one blue toy must be selected, exclude the empty set:
\[
16-1=15
\]
Thus, the number of ways to choose blue toys is
\[
15
\]
Step 3: Select red toys.
There are \(3\) different red toys.
Red toys may or may not be selected.
Hence, total possible selections are
\[
2^3=8
\]
Step 4: Apply multiplication principle.
Total number of combinations:
\[
31\times 15\times 8
\]
Step 5: Final conclusion.
Therefore,
\[
\boxed{31\times 15\times 8}
\]