#include<cstdio>
#include<fstream>
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<bitset>
#include<deque>
#include<queue>
#include<set>
#include<map>
#include<cmath>
#include<cstring>
#include<ctime>
#include<cstdlib>

#define ll long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define dbg(x) (cout<<#x<<" = "<<(x)<<endl)

using namespace std;

const int mod = 3210121;
const int smax = 10005;
const int kmax = 35;
const int nmax = 25;

int k,s,n,i,j,l,sol;
int f[2*smax];
int inv[2*smax];
int dp[kmax][smax];
int a[nmax][kmax];
int b[kmax];
int st[nmax];

int comb(int n,int k)
{
    int r;

    r=1LL*f[n]*inv[n-k]%mod;
    r=1LL*r*inv[k]%mod;

    return r;
}

int explog(int a,int b)
{
    int r=1;

    for(int i=1; i<=b; i<<=1)
    {
        if(i&b) r=1LL*r*a%mod;
        a=1LL*a*a%mod;
    }

    return r;
}

int modinv(int x)
{
    return explog(x,mod-2);
}

void back(int lev)
{
    int lastb[kmax];

    for(int i=1; i<=k; i++)
        lastb[i]=b[i];

    for(int i=st[lev-1]+1; i<=n; i++)
    {
        st[lev]=i;

        for(int j=1; j<=k; j++)
            if(a[i][j]>b[j])
                b[j]=a[i][j];

        int tmp=s;
        for(int j=1; j<=k; j++)
            tmp-=b[j];

        if(tmp>=0)
        {
            if(lev&1)
            {
                sol+=dp[k][tmp];
                if(sol>=mod) sol-=mod;
            }
            else
            {
                sol-=dp[k][tmp];
                if(sol<0) sol+=mod;
            }
        }

        back(lev+1);

        for(int j=1; j<=k; j++)
            b[j]=lastb[j];
    }
}

int main()
{
    freopen("cowfood.in","r",stdin);
    freopen("cowfood.out","w",stdout);

    scanf("%d%d%d",&k,&s,&n);

    f[0]=inv[0]=1;
    for(i=1; i<=2*s; i++)
    {
        f[i]=1LL*f[i-1]*i%mod;
        inv[i]=modinv(f[i]);
    }

    // dp[i][j] = numarul de modalitati de a obtine
    // sumele de la 0 la j din i pozitii

    for(i=1; i<=k; i++)
        for(j=0; j<=s; j++)
        {
            if(j>0) dp[i][j]=dp[i][j-1]+comb(i+j-1,i-1);
            else dp[i][j]=comb(i+j-1,i-1);

            if(dp[i][j]>=mod) dp[i][j]-=mod;
        }

    for(i=1; i<=n; i++)
        for(j=1; j<=k; j++)
            scanf("%d",&a[i][j]);

    back(1);

    sol=(dp[k][s]-sol+mod)%mod;
    sol=sol-s*k-1;
    if(sol<0) sol+=mod;

    printf("%d\n",sol);

    return 0;
}