title: Reaching nth Stair
body: <p>total number of ways to reach the nth floor with following types of moves:
  Type 1 in a single move you can move from i to i+1 floor – you can use the this move any number of times</p>
  <p>Type 2 in a single move you can move from i to i+2 floor – you can use this move any number of times</p>
  <p>Type 3 in a single move you can move from i to i+3 floor – but you can use this move at most k times</p>
  <p>i know how to reach nth floor by following step 1 ,step 2, step 3 any number of times using dp like dp[i]=dp[i-1]+dp[i-2]+dp[i-3].i am stucking in the condition of Type 3 movement with atmost k times.
  someone tell me the approach here.</p>