sumPrimes :: Integer -> Integer -> Integer
sumPrimes n k
 |k == 0  = 0
 |(isPrime n (n-1))&& (k > 1 ) = n + sumPrimes (n+1) k-1
 |otherwise = sumPrimes (n+1) k
 where
  isPrime :: Integer -> Integer -> Bool
  isPrime num  div
   | ((num `mod` div ) == 0 ) && ( div > 1 )  = False
   | (num >= 2 ) && (div == 1)  = True
   |otherwise = isPrime num (div-1)