public int countPathsRecursive(int n, int m){
        if(n == 1 || m == 1){
            return 1;
        }
        return countPathsRecursive(n-1, m) + countPathsRecursive(n, m-1);
    }
http://www.geeksforgeeks.org/count-possible-paths-top-left-bottom-right-nxm-matrix/
src/com/interview/dynamic/NumberOfPathsInMxNMatrix.java