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

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

const int mod = 1000000007;
const int N = 74;
const int MAGIC = 174;

void updAdd(int& a, int b)
{
	a += b;
	if (a >= mod)
		a -= mod;
}

int mult(int a, int b)
{
	return (LL) a * b % mod;
}

int binpow(int a, int n)
{
	int res = 1;
	while (n)
	{
		if (n & 1)
			res = mult(res, a);
		a = mult(a, a);
		n >>= 1;
	}
	return res;
}

struct Matrix
{
	int a[N][N];
	
	Matrix()
	{
		FOR (i, 0, N)
			fill(a[i], a[i] + N, 0);
	}
	
	Matrix(int x)
	{
		FOR (i, 0, N)
		{
			FOR (j, 0, N)
			{
				a[i][j] = i == j ? x : 0;
			}
		}
	}
	
	Matrix operator *(const Matrix& m)
	{
		Matrix res;
		FOR (i, 0, N)
		{
			FOR (j, 0, N)
			{
				FOR (k, 0, N)
				{
					updAdd(res.a[i][j], mult(a[i][k], m.a[k][j]));
				}
			}
		}
		return res;
	}
} pw[MAGIC];

int vec[N], nvec[N];

int main()
{
	ios::sync_with_stdio(0); 
	cin.tie(0);
	int n, m, T;
	cin >> n >> m >> T;
	pw[0] = 1;
	FOR(i, 0, n)
	{
		string s;
		cin >> s;
		int cnt = count(ALL(s), '1');
		int invCnt = binpow(cnt, mod - 2);
		FOR(j, 0, n)
			pw[1].a[j][i] = s[j] == '1' ? invCnt : 0;
	}
	FOR(i, 2, MAGIC)
		pw[i] = pw[i - 1] * pw[1];
	VI t(m), v(m);
	FOR(i, 0, m)
	{
		cin >> t[i] >> v[i];
		t[i]--;
		v[i]--;
	}
	int ans = 0;
	int ptr = 0;
	int alpha = 0;
	FOR(timer, 0, T)
	{
		bool newEvent = ptr < m && t[ptr] == timer;
		if (alpha == MAGIC - 1 || newEvent)
		{
			FOR(i, 0, n)
			{
				nvec[i] = 0;
				FOR(j, 0, n)
					updAdd(nvec[i], mult(pw[alpha].a[i][j], vec[j]));
			}
			FOR(i, 0, n)
				vec[i] = nvec[i];
			alpha = 0;
		}
		if (newEvent)
		{
			updAdd(vec[v[ptr]], 1);
			ptr++;
		}
		int cur = 0;
		FOR(j, 0, n)
			updAdd(cur, mult(pw[alpha].a[n - 1][j], vec[j]));
		ans ^= cur;
		alpha++;
	}
	cout << ans << "\n";
	return 0;
}