Hopefully the title of this question isn't the incorrect way to phrase the problem I'm having. If so let me know and I'll update it.
I have three items (A, B and C) and each item has three unique values (1, 2 and 3) they can hold.
How can I calculate all the various combinations? Where A, B, C might not always appear together at once.
Below is a list of 36 combinations (hopefully I've not missed any)...
A=1
A=2
A=3
B=1
B=2
B=3
C=1
C=2
C=3
A=1, B=1
A=1, B=2
A=1, B=3
A=2, B=1
A=2, B=2
A=2, B=3
A=1, C=1
A=1, C=2
A=1, C=3
A=2, C=1
A=2, C=2
A=2, C=3
B=1, C=1
B=1, C=2
B=1, C=3
B=2, C=1
B=2, C=2
B=2, C=3
A=1, B=1, C=1
A=2, B=2, C=2
A=3, B=3, C=3
A=2, B=1, C=1
A=3, B=1, C=1
A=1, B=2, C=1
A=1, B=3, C=1
A=1, B=1, C=2
A=1, B=1, C=3
UPDATE/ADDITIONAL QUESTION
What would the formula look like if there were a larger number of values assigned to A, B and C. For A might hold numbers from 1-4, where as B might hold numbers 1-10, and C might hold numbers 1-2.
You have $x$ variables and want to assign $y$ values to them with $x,y \in \mathbb{N}$, so that is $y^x$ possibilities.
If you want to assign the values $\{0,1,2,3\}$ , with $"0"$ being no value, to the set $\{A,B,C\}$, you have $4^3$ ways of doing so.