#include <cstdio>
#include <algorithm>

using namespace std;

const int mod=3210121;

int d[35][10010],v[25][35],n,sol,a[35],k,s;

void solve(int poz,int cnt,int s1)
{
    if(poz==n+1)
    {
        if(s1>s or s1==0) return;
        s1=d[k][s-s1];
        if(cnt%2==1) sol=sol-s1+mod;
        else sol+=s1;
        if(sol>=mod) sol-=mod;
        return;
    }
    int v1[35];
    for(int i=1;i<=k;i++) v1[i]=a[i];
    solve(poz+1,cnt,s1);
    s1=0;
    for(int i=1;i<=k;i++)
    {
        a[i]=max(a[i],v[poz][i]);
        s1+=a[i];
        if(s1>=mod) s1-=mod;
    }
    solve(poz+1,cnt+1,s1);
    for(int i=1;i<=k;i++) a[i]=v1[i];
}

int main()
{
    freopen("cowfood.in","r",stdin);
    freopen("cowfood.out","w",stdout);
    scanf("%d%d%d",&k,&s,&n);
    for(int i=0;i<=s;i++) d[1][i]=i+1;
    for(int i=2;i<=k;i++)
    {
        d[i][0]=1;
        for(int j=1;j<=s;j++)
        {
            d[i][j]=d[i-1][j]+d[i][j-1];
            if(d[i][j]>=mod) d[i][j]-=mod;
        }
    }
    sol=(d[k][s]-1-s*k+mod)%mod;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=k;j++) scanf("%d",&v[i][j]);
    solve(1,0,0);
    printf("%d",sol);
    return 0;
}