#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define X first
#define Y second
#define SZ(a) ((int)a.size())
#define pb push_back
#define ALL(v) v.begin(), v.end()

constexpr int M = 1'000'000'007;
constexpr int N = 75;
constexpr int NT = 2e6 + 5;
using u64 = uint64_t;

constexpr int K = 200;
// constexpr int K = 10;

u64 mypw(u64 x, int k) {
    if (!k) return 1;
    u64 a = mypw(x, k / 2);
    a = a * a % M;
    if (k & 1) return a * x % M;
    else return a;
}
u64 inv[N], inv_odg[N];
u64 mp[N][N], cont[K + 5][N][N];
int odg[N];

u64 ans[NT];

void add(u64 &a, u64 b) {
    a = (a + b) % M;
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    for (int i = 1; i < N; i++)
        inv[i] = mypw(i, M - 2);
    int n, m, T;
    cin >> n >> m >> T;
    for (int i = 0; i < n; i++) {
        string s;
        cin >> s;
        for (int j = 0; j < n; j++) {
            mp[i][j] = (s[j] == '1');
            if (mp[i][j])
                odg[i]++;
        }
    }
    for (int i = 0; i < n; i++) {
        inv_odg[i] = inv[odg[i]];
        // cerr << "invodg " << i << " " << inv_odg[i] << endl;
    }
    for (int i = 0; i < n; i++)
        cont[0][i][i] = 1;
    for (int t = 0; t < K; t++)
        for (int i = 0; i < n; i++)
            for (int j = 0; j < n; j++) {
                u64 x = cont[t][i][j] * inv_odg[j] % M; 
                for (int k = 0; k < n; k++)  
                    if (mp[j][k])
                        add(cont[t + 1][i][k], x);
            }
    vector<pii> v(m);
    for (int i = 0; i < m; i++)
        cin >> v[i].X >> v[i].Y, v[i].Y--;
    sort(ALL(v));
    int it = 0;
    vector<u64> p(n);
    // 0 ~ K - 1, K ~ 2K - 1, ... 
    for (int bs = 0; bs <= T; bs += K) {
        for (int i = 0; i < n; i++)
            for (int j = 0; j < K && bs + j <= T; j++)
                add(ans[bs + j], p[i] * cont[j][i][n - 1]);
        vector<u64> np(n);
        for (int i = 0; i < n; i++)
            for (int j = 0; j < n; j++)
                add(np[j], p[i] * cont[K][i][j]);
        while (it < SZ(v) && v[it].X < bs + K) {
            for (int j = 0; j + v[it].X < bs + K && j + v[it].X <= T; j++)
                add(ans[v[it].X + j], cont[j][v[it].Y][n - 1]);
            for (int i = 0; i < n; i++)
                add(np[i], cont[bs + K - v[it].X][v[it].Y][i]); 
            it++;
        }
        p.swap(np);
    }
    u64 res = 0;

    for (int i = 1; i <= T; i++) {
        // cerr << i << ": " << ans[i] << endl; 
        res ^= ans[i];
    }
    cout << res << endl;
}