#include <bits/stdc++.h>

using namespace std;

const int MOD = 3210121;
const int Nmax = 30 + 5;
const int Mmax = 20 + 5;
const int Smax = 10000 + 10;

int n , S , m , i , j , ans;
int p[Mmax] , a[Nmax] , v[Mmax][Nmax] , d[Nmax][Smax];

bool cmp(int a , int b)
{
    return (v[a][0] > v[b][0]);
}

void note(int nrV , int sum)
{
    //if (nrV == 0) return;
    int mode = (nrV&1) ? -1 : 1;
    ans += mode * d[n][S-sum] + MOD;
    while (ans >= MOD) ans -= MOD;
}

void backk(int k , int nrV , int sum , int b[Nmax])
{
    int i , a[Nmax];
    for (i = 1; i <= n; ++i) a[i] = b[i];

    if (k == m + 1)
    {
        note(nrV , sum);
        return;
    }

    backk(k + 1 , nrV , sum , a);

    for (i = 1; i <= n; ++i)
        if (a[i] < v[p[k]][i])
            sum += v[p[k]][i] - a[i],
            a[i] = v[p[k]][i];

    if (sum <= S) backk(k + 1 , nrV + 1 , sum , a);
}

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

    scanf("%d %d %d", &n, &S, &m);

    for (i = 1; i <= m; ++i)
    {
        for (j = 1; j <= n; ++j)
        {
            scanf("%d", &v[i][j]);
            v[i][0] += v[i][j];
        }
        p[i] = i;
    }

    sort(p + 1 , p + m + 1 , cmp);

    for (i = 1; i <= n; ++i) d[i][0] = 1;
    for (i = 0; i <= S; ++i) d[0][i] = 1;

    ///d[i][j] - nr posibilitati de a obtine sumele 0..j cu i numere
    for (i = 1; i <= n; ++i)
        for (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;
        }

    backk(1 , 0 , 0 , a);

    ans = (1LL * ans - 1LL * n * S + 1LL * n * MOD - 1LL) % MOD;

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

    return 0;
}