Ok, but we use DP anyway!

We can handle it using supercomputers :))

That's simple : dp[1][1]=2

update :

dp[0][0] = 0
dp[i][j]=dp[i][j-1]+1 if j>0
and
dp[i][j]=dp[i-1][j]+1 if i>0