class Solution
{
    public:
    
    bool solve(vector<vector<int>>grid,int ir,int ic,int row,int col,vector<vector<int>>memo){
        
        if(!(ir>=0 && ir<row && ic>=0 && ic<col)) return false;
        
        if(memo[ir][ic]==0)return false;

        if(grid[ir][ic]==2){
            memo[ir][ic]=1;
            return true;
        }
        
        if(grid[ir][ic]==0){
            memo[ir][ic]=0;
            return false;
        }
        
        int temp=grid[ir][ic];
        grid[ir][ic]=0;
        
        bool a=solve(grid,ir+1,ic,row,col,memo);
        bool b=solve(grid,ir-1,ic,row,col,memo);
        bool c=solve(grid,ir,ic+1,row,col,memo);
        bool d=solve(grid,ir,ic-1,row,col,memo);
        
        grid[ir][ic]=temp;
        
        bool ans = a||b||c||d;
        
        if(ans)memo[ir][ic]=1;
        else memo[ir][ic]=0;
        
        return ans;
    }
    //Function to find whether a path exists from the source to destination.
    bool is_Possible(vector<vector<int>>& grid) 
    {
        //code here
        int row = grid.size();
        int col = grid[0].size();
        
        int ir,ic;
        
        vector<vector<int>>memo(501,vector<int>(501,-1));
        
        for(int i=0;i<row;i++){
            for(int j=0;j<col;j++){
                if(grid[i][j]==1){
                    ir=i;
                    ic=j;
                }
            }
        }
        return solve(grid,ir,ic,row,col,memo);
    }
};