The following problem needs to be done in Java.

Given n dice each with m faces, numbered from 1 to m, find the number of ways to get sum X.

X is the summation of values on each face when all the dice are thrown.