isPrime :: Integer->Bool  -- <--- Помощна функция за намиране на просто число.
isPrime n =helper 2 where
 helper i
  |i < n  = if n `mod` i == 0 then False else helper (i+1)
  |n==1 || n==0 = False
  |otherwise = True
sumPrimes::Integer->Integer->Integer
sumPrimes n k = helper 0 0 n where
 helper sum count n
  |count < k = if(isPrime n) then helper (sum+n) (count+1) (n+1) else helper sum count (n+1) -- (*)
  |otherwise = sum