assuming you have aabcc and you want to count all the unique groups that can be made with them so:
[empty,a,ab,ac,acc,abc,abcc,aa,aab,aac,aacc,aabc,aabcc,b,bc,bcc,c,cc]
= 18
assuming you have aabcc and you want to count all the unique groups that can be made with them so:
[empty,a,ab,ac,acc,abc,abcc,aa,aab,aac,aacc,aabc,aabcc,b,bc,bcc,c,cc]
= 18
You can take $0$, $1$, or $2$ copies of
a, which is $2+1=3$ choices; similarly $2$ forband $3$ forc. Multiplying, there are $$(2+1)\times(1+1)\times(2+1)=3\times2\times3=18$$ ways to independently choose the number ofas,bs, andcs.