Count total paths in a maze to move from (0,0) to (n,m)

public class Recursion2 {
    public static int countPaths(int i, int j, int n, int m) {
        //BASE condition for boundary
        if(i == n || j == m) { 
            return 0;
        }

        //BASE condition
        if(i == n-1 && j == m-1) {
            return 1;
        }
        
        //move downwards
        int downPaths = countPaths(i+1, j, n, m);

        //move right
        int rightPaths = countPaths(i, j+1, n, m);

        return downPaths + rightPaths;
    }
    public static void main(String[] args) {
        int n = 3;
        int m = 3; 
        
        //initially i and j are (0,0)
        int totalPaths = countPaths(0, 0, n, m);
        System.out.println(totalPaths);
    }
}