Rats in Maze

#include <iostream>
using namespace std;
bool ratInMaze(char maze[][1005],int sol[][1005],int i,int j,int m,int n)
{
    if(i==m && j==n)
    {
        sol[i][j] = 1;
        for(int row=0;row<=m;row++)
        {
            for(int col=0;col<=n;col++)
            {
                cout<<sol[row][col]<<" ";
            }
            cout<<endl;
        }
        cout<<endl;
        return true;
    }

    //Rat should be inside the maze
    if(i>m || j>n)
        return false;

    //Should not encounter a blocked cell
    if(maze[i][j] == 'X')
        return false;

    sol[i][j] = 1;

    bool rightSuccess = ratInMaze(maze,sol,i,j+1,m,n);
    if(rightSuccess){
        return true ;
    }
    bool downSuccess  = ratInMaze(maze,sol,i+1,j,m,n);
    if(downSuccess){
        return true ;
    }

    //Backtrack
    sol[i][j] = 0;

    return false;

}
int main() 
{
    char maze[1005][1005];
    int sol[1005][1005]= {0};
    int m ;     //No of rows
    int n ;     //No of cols
    cin >> m >> n;
    for(int i=0;i<m;i++){
        for(int j=0;j<n;j++){
            cin >> maze[i][j];
        }
    }

    bool ans = ratInMaze(maze,sol,0,0,m-1,n-1);
    if(!ans)
        cout<<"-1";


    return 0;
}