title: Dice Throw Problem
signature: function diceThrowProblem(m, n, x) {
test_code: 
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  function convertToString(value) {
      return JSON.stringify(value, function (key, val) {
          if (val instanceof Set) {
              return Array.from(val);
          } return val;});
  }
  
  function validateSolution(actual, expected){
      return convertToString(actual)===convertToString(expected);
  }
  
  function driver(m, n, x, expected){
      try{
          if (validateSolution(PLACEHOLDER_FN_NAME(m, n, x),expected)){
              return "PASSED";
          }
          return "FAILED";
      } catch (error) {
        return error.name;
      }
      
  }
      
  function main(){
    let result = '';
    result = driver(94, 4, 69, 50116);
    console.log(`TEST-0...${result}`);
  
    result = driver(7, 12, 33, 77635844);
    console.log(`TEST-1...${result}`);
  
    result = driver(20, 44, 24, 0);
    console.log(`TEST-2...${result}`);
  
    result = driver(90, 94, 88, 0);
    console.log(`TEST-3...${result}`);
  
    result = driver(50, 58, 27, 0);
    console.log(`TEST-4...${result}`);
  
    result = driver(32, 90, 29, 0);
    console.log(`TEST-5...${result}`);
  
    result = driver(46, 25, 6, 0);
    console.log(`TEST-6...${result}`);
  
    result = driver(43, 82, 70, 0);
    console.log(`TEST-7...${result}`);
  
    result = driver(6, 83, 19, 0);
    console.log(`TEST-8...${result}`);
  
    process.exit(0);
  };
  
  if (require.main === module) {
    main();
  }
source_py: def dice_throw_problem(m, n, x):
      table = [([0] * (x + 1)) for i in range((n + 1))]
      for j in range(1, min((m + 1), (x + 1))):
          table[1][j] = 1
      for i in range(2, (n + 1)):
          for j in range(1, (x + 1)):
              for k in range(1, min((m + 1), j)):
                  table[i][j] += table[(i - 1)][(j - k)]
      return table[(- 1)][(- 1)]
source_cpp: int dice_throw_problem(int m, int n, int x) {
    int table [ n + 1 ] [ x + 1 ];
    memset ( table, 0, sizeof ( table ) );
    for ( int j = 1;
    j <= m && j <= x;
    j ++ ) table [ 1 ] [ j ] = 1;
    for ( int i = 2;
    i <= n;
    i ++ ) for ( int j = 1;
    j <= x;
    j ++ ) for ( int k = 1;
    k <= m && k < j;
    k ++ ) table [ i ] [ j ] += table [ i - 1 ] [ j - k ];
    return table [ n ] [ x ];
  }