#include <bits/stdc++.h>
#define ALL(v) begin(v), end(v)

using i64 = int64_t;

const int kMaxN = 75, kMaxT = 2E6 + 5, kMod = 1E9 + 7;
void Add(int &x, int y) {
  if ((x += y) >= kMod) x -= kMod;
}
auto Sum(int x, int y) { return Add(x, y), x; }
auto Neg(int x) { return Sum(kMod, -x); }
auto Power(int a, int b, int p = kMod) {
  int r = 1;
  for (; b; b >>= 1, a = i64{a} * a % p) {
    if (b & 1) r = i64{r} * a % p;
  }
  return r;
}
auto Inv(int a, int p = kMod) { return Power(a, p - 2, p); }

int n, m, t;
std::array<std::string, kMaxN> g;

std::array<int, kMaxN> coef, poly;
std::array<std::array<int, kMaxN>, kMaxN> adj, mat;
auto Det() {
  int r = n & 1 ? 1 : Neg(1);
  for (int i = 0, j, inv; i < n; ++i) {
    for (j = i; j < n && !mat[j][i]; ++j);
    if (j == n) return 0;
    if (j - i) std::swap(mat[i], mat[j]), r = Neg(r);
    r = i64{r} * mat[i][i] % kMod, inv = Neg(Inv(mat[i][i]));
    for (int j = i + 1; j < n; ++j) {
      int rat = i64{mat[j][i]} * inv % kMod;
      for (int k = i; k < n; ++k) Add(mat[j][k], i64{mat[i][k]} * rat % kMod);
    }
  }
  return r;
}
void CharPoly() {
  for (int i = 0; i <= n; ++i) {
    mat = adj;
    for (int j = 0; j < n; ++j) Add(mat[j][j], Neg(i));
    int c = Det();
    for (int j = poly[0] = 1; j < n; ++j) poly[j] = 0;
    for (int j = 0; j <= n; ++j) {
      if (i == j) continue;
      c = i64{c} * Inv(i - j + kMod) % kMod;
      for (int k = n - 1; ~k; --k) {
        poly[k] = i64{poly[k]} * Neg(j) % kMod;
        if (k) Add(poly[k], poly[k - 1]);
      }
    }
    for (int j = 0; j < n; ++j) Add(coef[j], i64{c} * poly[j] % kMod);
  }
}

int ans;
std::array<int, kMaxN> f;
std::array<int, kMaxT> v;
std::array<std::array<int, kMaxN>, kMaxN> lit;

auto main() -> int {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr), std::cout.tie(nullptr);

  std::cin >> n >> m >> t;
  for (int i = 0; i < n; ++i) std::cin >> g[i];
  for (int i = 0; i < n; ++i) {
    int ideg = Inv(std::count(ALL(g[i]), '1'));
    for (int j = 0; j < n; ++j) {
      if (g[i][j] == '1') adj[i][j] = ideg;
    }
  }
  CharPoly();
  lit[0][n - 1] = 1;
  for (int i = 1; i < n; ++i) {
    for (int j = 0; j < n; ++j) {
      for (int k = 0; k < n; ++k) {
        Add(lit[i][j], i64{adj[j][k]} * lit[i - 1][k] % kMod);
      }
    }
  }
  for (int i = 0, t, p; i < m; ++i) std::cin >> t >> p, v[t] = p;
  for (int i = 1; i <= t; ++i) {
    __int128 s = 0;
    for (int j = 0; j < n; ++j) s += i64{f[j]} * coef[j];
    for (int j = 1; j < n; ++j) f[j - 1] = f[j];
    f[n - 1] = s % kMod;
    if (v[i]) {
      for (int j = 0; j < n; ++j) Add(f[j], lit[j][v[i] - 1]);
    }
    ans ^= f[0];
  }
  std::cout << ans << '\n';

  return 0;
}