#include <bits/stdc++.h>
using namespace std;

ifstream fin("cowfood.in");
ofstream fout("cowfood.out");
const int MOD = 3210121;

int n, s, k;
int E[24][34];
int maxi[34];
int nr, nr_total;
int fact[10104];
int inv[10104];
int rez;

int putere(int a, int p)
{
    int rez = 1;
    while (p > 0)
    {
        if (p % 2 == 0)
        {
            a = (1LL * a * a) % MOD;
            p /= 2;
        }
        else
        {
            rez = (1LL * rez * a) % MOD;
            p--;
        }
    }
    return rez;
}

void precalc()
{
    fact[0] = 1;
    inv[0] = 1;
    for (int i = 1; i <= s + k + 4; i++)
    {
        fact[i] = (1LL * fact[i - 1] * i) % MOD;
    }
    for (int i = 1; i <= s + k + 4; i++)
    {
        inv[i] = (1LL * inv[i - 1] * putere(i, MOD - 2)) % MOD;
    }
}

int comb(int n, int k)
{
    return (1LL * ((1LL * fact[n] * inv[n - k]) % MOD) * inv[k]) % MOD;
}
int main()
{
    fin >> n >> s >> k;
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= k; j++)
        {
            fin >> E[i][j];
        }
    }
    precalc();
    nr_total = (comb(s + k, k) - (k * s) - 1);
    if (nr_total < 0)
    {
        nr_total += MOD;
    }
    for (int conf = 1; conf < (1 << n); conf++)
    {
        nr = 0;
        memset(maxi, -1, sizeof(maxi));
        for (int i = 0; i < n; i++)
        {
            if (conf & (1 << i))
            {
                nr++;
                for (int j = 1; j <= k; j++)
                {
                    maxi[j] = max(maxi[j], E[i + 1][j]);
                }
            }
        }
        long long sum = 0;
        long long dif0 = 0;
        for (int i = 1; i <= k; i++)
        {
            sum += maxi[i];
            if (maxi[i] != 0)
            {
                dif0++;
            }
        }
        long long dif = s - sum;
        if (sum <= s && dif0 >= 2)
        {
            int comun = comb(dif + k, k);
            if (nr % 2 == 1)
            {
                nr_total = (nr_total - comun);
                if (nr_total < 0)
                {
                    nr_total += MOD;
                }
            }
            else
            {
                nr_total = (nr_total + comun) % MOD;
            }
        }
    }
    fout << nr_total;
    fin.close();
    fout.close();
    return 0;
}