Highway Bypass INOI

#include<iostream>
#include<algorithm>
#define modulo 20011
using namespace std;
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int R, C, d,**paths,**matrix;
    cin >> R >> C >> d;
    matrix = new int*[R + 1];
    paths = new int*[R + 1];
    for (int i = 0; i < R + 1; i++ )
    {
        matrix[i] = new int[C + 1];
        paths[i] = new int[C + 1];
    }
    for (int i = 1; i < R + 1; i++)
    {
        paths[i][1] = 1;
    }
    for (int j = 1; j < C + 1; j++)
    {
        paths[1][j] = 1;
    }
    for (int i = 1; i < R + 1; i++)
    {
        for (int j = 1; j < C + 1; j++)
        {
            cin >> matrix[i][j];
            if (matrix[i][j] == 0)
            {
                paths[i][j] = 0;
                if (i == 1)
                {
                    for (int k = j + 1; k < C + 1; k++)
                        paths[1][k] = 0;
                }
                if (j == 1)
                {
                    for (int z = i + 1; z < R + 1; z++)
                        paths[z][1] = 0;
                }

            }
        }
    }
    paths[1][1] = 1;
    for (int i = 2; i < R + 1; i++)
    {
        for (int j = 2; j < C + 1; j++)
        {
            if (paths[i][j] != 0)
            {
                paths[i][j] = (paths[i - 1][j]%modulo + paths[i][j - 1]%modulo)%modulo;
            }
        }
    }
    cout << paths[R][C];
}