#include <fstream>
#include <vector>

#define nprim 3210121

using namespace std;

ifstream f("cowfood.in");
ofstream g("cowfood.out");

int k,s,n;

vector<vector<int> > combinari;
vector<vector<int> > esuate;

void comb()
{
    combinari.resize(s+k+10);
    for(int i=0; i<=s+k; ++i)
    {
        combinari[i].resize(k+10,0);
        combinari[i][0]=1;
        if(i==0)
            continue;
        for(int j=1; j<=k && j<=i; ++j)
        {
            combinari[i][j]=combinari[i-1][j]+combinari[i-1][j-1];
            combinari[i][j]%=nprim;
        }
    }
}

int stiva[21];
int maxime[21][31];
int ans;
int semn=1;

void backtrack(int niv)
{
    if(niv==n+1)
    {
        int suma_maxime=0;
        for(int i=0;i<k;++i)
            suma_maxime+=maxime[n][i];

        int rest=s-suma_maxime;

        ans=(ans+semn*combinari[k+rest][k]+nprim)%nprim;

        return;

    }
    stiva[niv]=0;
    for(int i=0;i<k;++i)
    {
        maxime[niv][i]=maxime[niv-1][i];
    }
    backtrack(niv+1);
    stiva[niv]=1;
    semn*=-1;
    for(int i=0;i<k;++i)
    {
        maxime[niv][i]=max(maxime[niv-1][i],esuate[niv-1][i]);
    }
    backtrack(niv+1);
    semn*=-1;
}

int main()
{
    f>>k>>s>>n;
    comb();
    esuate.resize(n);
    for(int i=0; i<n; ++i)
    {
        esuate[i].resize(k);
        for(int j=0; j<k; ++j)
            f>>esuate[i][j];
    }

    backtrack(1);

    ans=(ans-(s*k+1)+nprim)%nprim;

    g<<ans;

    return 0;
}