#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef unsigned long long ull;

const int mod = int(1e9 + 7);

#define N 71
#define M 10010
int n, m, T;

string s;
bool b[N][N];
int dp[N][N][N], f[N][N];
int ans;
int lV[N], nV[N];
int t[M], v[M];

int qpow(int a, int b)
{
    int ans = 1;
    while (b) {if (b & 1) ans = 1LL * ans * a % mod; b >>= 1; a = 1LL * a * a % mod;}
    return ans;
}

void mul(int g[N][N], int h[N][N])
{
    for (int i = 1; i <= n; i ++)
    {
        for (int j = 1; j <= n; j ++)
        {
            for (int k = 1; k <= n; k ++)
            {
                h[i][j] = (h[i][j] + 1LL * g[i][k] * f[k][j]) % mod;
            }
        }
    }
}

void calc(int t)
{
    while (t)
    {
        int k = min(t, n);
        for (int i = 1; i <= k; i ++)
        {
            int s = 0;
            for (int j = 1; j <= n; j ++)s = (s + 1LL * lV[j] * dp[i][j][n]) % mod;
            ans ^= s;
        }
        for (int i = 1; i <= n; i ++)
        {
            for (int j = 1; j <= n; j ++) nV[j] = (nV[j] + 1LL * lV[i] * dp[k][i][j]) % mod;
        }
        for (int i = 1; i <= n; i ++) lV[i] = nV[i], nV[i] = 0;
        t -= k;
    }
}

void sol()
{
    cin >> n >> m >> T;
    for (int i = 1; i <= n; i ++)
    {
        cin >> s;
        for (int j = 1; j <= n; j ++)
        {
            if (s[j - 1] == '1') b[i][j] = 1;
            else b[i][j] = 0;
        }
    }

    for (int i = 1; i <= n; i ++)
    {
        int d = 0;
        for (int j = 1; j <= n; j ++) if (b[i][j]) d ++;
        d = qpow(d, mod - 2);
        for (int j = 1; j <= n; j ++) if (b[i][j]) f[i][j] = d;
    }

    for (int i = 1; i <= n; i ++)dp[0][i][i] = 1;
    for (int i = 1; i <= n; i ++)mul(dp[i - 1], dp[i]);

    // cout << "???:" << dp[n][1][n] << '\n';

    for (int i = 1; i <= m; i ++)
    {
        cin >> t[i] >> v[i];
    }
    if (t[m] < T){m ++; t[m] = T, v[m] = 0;}
    for (int i = 1; i <= m; i ++)
    {
        calc(t[i] - t[i - 1] - 1);
        for (int p = 1; p <= n; p ++)
        {
            for (int q = 1; q <= n; q ++) nV[q] = (nV[q] + 1LL * lV[p] * f[p][q]) % mod;
        }
        for (int p = 1; p <= n; p ++) lV[p] = nV[p], nV[p] = 0;
        lV[v[i]] = (lV[v[i]] + 1) % mod; ans ^= lV[n];
    }
    cout << ans << '\n';
}

int main()
{
    ios::sync_with_stdio(0); cin.tie(0);
    int T = 1;
    while (T --) sol();
    return 0;
}