Imagine i have m marbles and b boxes. Imagine the boxes all are distinct (for example have different colors) and the marbles all are distinct (have different patterns). Then there would be b^m ways to arrange them. Can someone answer the general formula for calculating the number of ways to arrange them if

>neither the marbles or the boxes are distinct
>the marbles are disctinct but the boxes arent
>the boxes are distinct but the marbles arent