title: Subsequences Size Three Array Whose Sum Divisible M
signature: subsequencesSizeThreeArrayWhoseSumDivisibleM(a, n, m) {
test_code: import 'dart:convert';
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(int actual, int expected){
      return actual.toString() == expected.toString();
  }
  
  String driver(a, n, m, int expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(a, n, m), expected)){
              return "PASSED";
          }
          return "FAILED";
      }catch(exception_object){
          return exception_object.runtimeType.toString();
      }
  }
  
  int main() {
  
      print("TEST-0...${driver(
          [14, 35, 56, 70, 88], 3, 4, 
          0)
      }");
  
      print("TEST-1...${driver(
          [-50, -92, 16, -68, -36], 3, 4, 
          0)
      }");
  
      print("TEST-2...${driver(
          [0, 0, 0, 1, 1, 1], 4, 5, 
          1)
      }");
  
      print("TEST-3...${driver(
          [76, 43, 22, 41, 49, 99, 25, 40, 3, 45, 60, 16, 83, 62, 26, 93, 64, 73, 72, 53, 6, 32, 35, 67, 17], 14, 21, 
          19)
      }");
  
      print("TEST-4...${driver(
          [-90, -86, -86, -66, -50, -48, -44, -42, -42, -38, -24, -22, -20, -18, -8, 8, 24, 28, 34, 48, 60, 62, 66, 68, 74, 76, 80, 82, 88], 24, 20, 
          207)
      }");
  
      print("TEST-5...${driver(
          [1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0], 24, 30, 
          120)
      }");
  
      print("TEST-6...${driver(
          [4, 5, 8, 9, 10, 12, 13, 16, 17, 18, 21, 21, 25, 27, 28, 30, 36, 36, 54, 55, 56, 57, 60, 62, 67, 67, 68, 71, 72, 72, 73, 73, 77, 77, 83, 86, 86, 86, 87, 89, 92, 92, 96, 97, 97, 98], 24, 23, 
          85)
      }");
  
      print("TEST-7...${driver(
          [-64, 52, -32, 38, 8, -62, -56, 20, 72, -12, 32, 44], 6, 6, 
          2)
      }");
  
      print("TEST-8...${driver(
          [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], 12, 15, 
          220)
      }");
  
      print("TEST-9...${driver(
          [77, 68, 45, 6, 27, 19, 29, 95, 21, 2, 39, 48, 72, 67, 49, 45, 1, 16, 56, 78, 25, 22, 27, 40, 31, 34, 26, 35, 12], 25, 25, 
          92)
      }");
  
      return 0;
  }
source_py: def subsequences_size_three_array_whose_sum_divisible_m(A, N, M):
      sum = 0
      ans = 0
      for i in range(0, N):
          for j in range((i + 1), N):
              for k in range((j + 1), N):
                  sum = ((A[i] + A[j]) + A[k])
                  if ((sum % M) == 0):
                      ans = (ans + 1)
      return ans
source_cpp: int subsequences_size_three_array_whose_sum_divisible_m(vector<int> A, int N, int M) {
    int sum = 0;
    int ans = 0;
    for ( int i = 0;
    i < N;
    i ++ ) {
      for ( int j = i + 1;
      j < N;
      j ++ ) {
        for ( int k = j + 1;
        k < N;
        k ++ ) {
          sum = A [ i ] + A [ j ] + A [ k ];
          if ( sum % M == 0 ) ans ++;
        }
      }
    }
    return ans;
  }