#include<bits/stdc++.h>
#define maxS 10005
#define maxK 35
#define MOD 3210121
using namespace std;
int st[maxK],dp[maxS][maxK],e[maxK],k,n,s,sol,a[maxK][maxK];
inline void bktr(int p,int e[],int nr)
{
    for(int i=0;i<=1;i++)
    {
        st[p]=i;
        if(i)
        {
            for(int j=1;j<=k;j++) e[j]=max(e[j],a[p][j]);
        }
        if(p==n)
        {
            int sum=0;
            for(int j=1;j<=k;j++)
            {
                sum=sum+e[j];
            }
        if(s>=sum)
        {
            if(nr%2) sol=sol+dp[k][s-sum];
                else sol=sol-dp[k][s-sum];
            while(sol>=MOD) sol-=MOD;
            while(sol<0) sol+=MOD;
        }

        }
            else bktr(p+1,e,nr+st[p]);

    }

}
int main()
{
    freopen("cowfood.in","r",stdin);
    freopen("cowfood.out","w",stdout);
    scanf("%d%d%d",&k,&s,&n);
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=k;j++)
        {
            scanf("%d",&a[i][j]);
        }
    }
    for(int i=0;i<=s+1;i++)
    {
        dp[0][i]=1;
    }

    for(int i=1;i<=k+1;i++)
    {
        for(int j=1;j<=s+1;j++)
        {
            dp[i][j]=(dp[i-1][j]+(!j?0:dp[i][j-1]));
            while(dp[i][j]>=MOD) dp[i][j]-=MOD;
        }
    }

    bktr(1,e,0);
    sol-=(1+s*k);
    while(sol<0) sol+=MOD;
    printf("%d\n",sol);
    return 0;

}