Haskell: Memory hog with DP despite using (2D) array

Question

Given two integers k and n, define

dp[j][0] = dp[j][n+1] = 0               for j=0,...k,
dp[0][m] = 1                            for