Big O complexity of NumberOfPathsInMxNMatrix.java

Hello,

I'm trying to figure out the Big O complexity of both of the algorithm writtne in https://github.com/mission-peace/interview/blob/master/src/com/interview/dynamic/NumberOfPathsInMxNMatrix.java

Is it correct to say for countPaths O(countPaths) = n + m + n*m

And what would it be for the recursive approach ?

thank you!