title: Find Sum Modulo K First N Natural Number
signature: findSumModuloKFirstNNaturalNumber :: Integer -> Integer -> Integer
  findSumModuloKFirstNNaturalNumber n k = 
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 -> String
  driver n k expected = do
      if (validateSolution (PLACEHOLDER_FN_NAME n k) expected)
          then "PASSED"
      else "FAILED"
  
  main = do
      printf "TEST-0...%s\n" (driver (11) (5) (21) )
  
      printf "TEST-1...%s\n" (driver (36) (69) (666) )
  
      printf "TEST-2...%s\n" (driver (71) (28) (876) )
  
      printf "TEST-3...%s\n" (driver (74) (1) (0) )
  
      printf "TEST-4...%s\n" (driver (66) (84) (2211) )
  
      printf "TEST-5...%s\n" (driver (38) (14) (237) )
  
      printf "TEST-6...%s\n" (driver (2) (11) (3) )
  
      printf "TEST-7...%s\n" (driver (73) (87) (2701) )
  
      printf "TEST-8...%s\n" (driver (79) (11) (388) )
  
      printf "TEST-9...%s\n" (driver (30) (55) (465) )
  
source_py: def find_sum_modulo_k_first_n_natural_number(N, K):
      ans = 0
      for i in range(1, (N + 1)):
          ans += (i % K)
      return ans
source_cpp: int find_sum_modulo_k_first_n_natural_number(int N, int K) {
    int ans = 0;
    for ( int i = 1;
    i <= N;
    i ++ ) ans += ( i % K );
    return ans;
  }