// 私は猫です

#include<bits/stdc++.h>
#define ull unsigned long long
#define ll long long
#define pb push_back
#define mkp make_pair
#define fi first
#define se second
#define inf 1000000000
#define infll 1000000000000000000ll
#define pii pair<int,int>
#define rep(i,a,b,c) for(int i=(a);i<=(b);i+=(c))
#define per(i,a,b,c) for(int i=(a);i>=(b);i-=(c))
#define F(i,a,b) for(int i=a,i##end=b;i<=i##end;i++)
#define dF(i,a,b) for(int i=a,i##end=b;i>=i##end;i--)
#define cmh(sjy) while(sjy--)
#define lowbit(x) (x&(-x))
#define HH printf("\n")
#define eb emplace_back
#define poly vector<int>
#define SZ(x) ((int)x.size())
using namespace std;
template<typename T>inline void chkmax(T &x,const T &y){ x=std::max(x,y); }
template<typename T>inline void chkmin(T &x,const T &y){ x=std::min(x,y); }
const int mod=1e9+7;
inline int qpow(int x,ll y){ int res=1; for(;y;y>>=1,x=1ll*x*x%mod)if(y&1)res=1ll*res*x%mod; return res; }
inline void inc(int &x,const int y){ x=(x+y>=mod)?(x+y-mod):(x+y); }
inline void dec(int &x,const int y){ x=(x>=y)?(x-y):(x+mod-y); }
inline void mul(int &x,const int y){ x=1ll*x*y%mod; }
inline int add(const int x,const int y){ return (x+y>=mod)?(x+y-mod):(x+y); }
inline int sub(const int x,const int y){ return (x>=y)?(x-y):(x+mod-y); }
inline int prod(const int x,const int y){ return 1ll*x*y%mod; }
const int B=200,NR=75,MR=10005,TR=2000005;
#define norm Fast_mod.Fresh
#define ulll __uint128_t
struct FastMod{ull p,w;FastMod(ull p=2):p(p),w((ull)(((ulll)(1)<<64)/p)){}ull Fresh(ull x){ull d=(ull)(((ulll)(w)*x)>>64),r=x-p*d;return r>=p?r-p:r;}}Fast_mod;
pii a[MR];
int n,mat[NR][NR],m,T,cur[NR],nxt[NR],ans[TR],inv[NR],c[NR],coef[B+2][NR][NR];
void solve(){
	cin>>n>>m>>T,Fast_mod=FastMod(mod);
	F(i,0,n)inv[i]=qpow(i,mod-2);
	F(i,1,n){
		string str; cin>>str;
		int cnt=0;
		F(j,1,n)mat[i][j]=(str[j-1]=='1'),cnt+=mat[i][j];
		c[i]=inv[cnt];
	}
	F(i,1,m)cin>>a[i].fi>>a[i].se; sort(a+1,a+m+1);
	F(i,1,n)coef[0][i][i]=1;
	F(t,0,B-1)F(u,1,n)F(v,1,n){
		const int val=norm(1ll*coef[t][u][v]*c[v]);
		if(!val)continue;
		F(i,1,n)if(mat[v][i])inc(coef[t+1][u][i],val);
	}
	int pos=0;
	for(int s=0;s<=T;s+=B){
        F(i,1,n)if(cur[i])F(j,0,min(B-1,T-s))inc(ans[s+j],norm(1ll*coef[j][i][n]*cur[i]));
		F(i,1,n){
			nxt[i]=0;
			F(j,1,n)inc(nxt[i],norm(1ll*cur[j]*coef[B][j][i]));
		}
		for(;pos<m&&a[pos+1].fi<s+B;){
			++pos; const int tim=a[pos].fi,u=a[pos].se;
			F(j,0,min(s+B-1,T)-tim)inc(ans[tim+j],coef[j][u][n]);
			F(i,1,n)inc(nxt[i],coef[s+B-tim][u][i]);
		}
		F(i,1,n)cur[i]=nxt[i];
	}
	int res=0; F(i,1,T)res^=ans[i]; cout<<res;
}
signed main(){
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	int zsy=1;
	F(____,1,zsy)solve();
}