Coin change with atmost k coins (Infinite number of coins)

What will be the recurrence of the problem:
I have formulated


  DP[i][j][k]=DP[i-1][j][k-1]||DP[i-1][j-Array[i]][k-1]||DP[i-1][j][k]

where I am using i as the i th coin to make j as sum using k coins at max

//