#include <bits/stdc++.h>

#pragma optimize GCC ("Ofast")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

///#include <tryhardmode>
///#include <GODMODE::ON>

using namespace std;

ifstream fin ("cowfood.in");
ofstream fout ("cowfood.out");

const int NMAX=35;
const int SMAX=1e4+5;
const int NMAX2=25;
const int MOD=3210121;

#define int long long

int dp0[2][SMAX];
int v[NMAX2][NMAX];
int maxime[NMAX];
long long wa;
int n,k,s;

void backt(int curr_array,long long mask)
{
    int i,j;
    if(curr_array==n)
    {
        long long smax=0;
        for(i=1;i<=k;i++)
        {
            maxime[i]=0;
            for(j=1;j<=n;j++)
                if(mask & (1<<(j-1)))
                    maxime[i]=max(maxime[i],v[j][i]);
        }
        for(i=1;i<=k;i++)
            smax+=maxime[i];
        if(smax>s || mask==0)
            return ;
        else
        {
            if(__builtin_popcount(mask)%2==0)
            {
                wa-=dp0[k%2][s-smax];
                wa+=MOD;
                wa%=MOD;
                return ;
            }
            else
            {
                wa+=dp0[k%2][s-smax];
                wa%=MOD;
                return ;
            }
        }
    }
    backt(curr_array+1,mask^(1<<curr_array));
    backt(curr_array+1,mask);
}

signed main()
{
    ios_base::sync_with_stdio(false);
    fin.tie(NULL);
    fout.tie(NULL);

    int i,j,ans;
    fin>>k>>s>>n;
    for(i=1;i<=n;i++)
        for(j=1;j<=k;j++)
            fin>>v[i][j];
    for(i=1;i<=s;i++)
        dp0[0][i]=1;
    for(i=1;i<=k;i++)
    {
        dp0[i%2][0]=1;
        for(j=1;j<=s;j++)
        {
            dp0[i%2][j]=dp0[(i+1)%2][j];
            dp0[i%2][j]+=dp0[i%2][j-1];
            dp0[i%2][j]%=MOD;
        }
    }
    ans=dp0[k%2][s-k];
    backt(0,0);
    fout<<(ans-wa+MOD)%MOD;
    fin.close();
    fout.close();
    return 0;
}