title: Subsequences Size Three Array Whose Sum Divisible M
signature: subsequencesSizeThreeArrayWhoseSumDivisibleM :: [Integer] -> Integer -> Integer -> Integer
  subsequencesSizeThreeArrayWhoseSumDivisibleM a n m = 
test_code: import Text.Printf
  import Control.Exception (catch, SomeException)
  import Data.Typeable
  import qualified Data.List as List
  import qualified Data.Map as Map
  import qualified Data.Set as Set
  
  -- SOLUTION CODE
  -- ============================================
  
  PLACEHOLDER_CODE_BODY
  
  -- TESTING CODE 
  -- ============================================
  validateSolution :: Integer -> Integer -> Bool
  validateSolution actual expected = do
      actual == expected
  
  
  driver :: [Integer] -> Integer -> Integer -> Integer -> String
  driver a n m expected = do
      if (validateSolution (PLACEHOLDER_FN_NAME a n m) expected)
          then "PASSED"
      else "FAILED"
  
  main = do
      printf "TEST-0...%s\n" (driver ([14, 35, 56, 70, 88]) (3) (4) (0) )
  
      printf "TEST-1...%s\n" (driver ([-50, -92, 16, -68, -36]) (3) (4) (0) )
  
      printf "TEST-2...%s\n" (driver ([0, 0, 0, 1, 1, 1]) (4) (5) (1) )
  
      printf "TEST-3...%s\n" (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) )
  
      printf "TEST-4...%s\n" (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) )
  
      printf "TEST-5...%s\n" (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) )
  
      printf "TEST-6...%s\n" (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) )
  
      printf "TEST-7...%s\n" (driver ([-64, 52, -32, 38, 8, -62, -56, 20, 72, -12, 32, 44]) (6) (6) (2) )
  
      printf "TEST-8...%s\n" (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) )
  
      printf "TEST-9...%s\n" (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) )
  
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;
  }