#include<iostream>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<cstdio>
using namespace std;
#define ull unsigned long long
int n,m,c,k;
ull a[1000005];
bool vis1[70],vis2[70];
int main(){
	scanf("%d%d%d%d",&n,&m,&c,&k);
	if(n==0 && k==64){
		cout<<"18446744073709551616";
	}
	for(int i=1; i<=n; ++i)
		scanf("%d",&a[i]);
	int x,y;
	for(int i=1; i<=m; ++i){
		scanf("%d%d",&x,&y);
		vis1[x]=1;
	}
	for(int i=1; i<=n; ++i){
		for(int j=0; j<k; ++j){
			if(vis1[j]==0) continue;
			ull tmp=(1<<j);
			if((a[i] & tmp) == tmp)
				vis2[j]=1;
		}
	}
	ull tot=1;
	int sum=0;
	for(int i=0; i<k; ++i){
		if(vis1[i]==0 || (vis1[i]==1 && vis2[i]==1)) {
			tot<<=1;
			++sum;
		}
	}
	cout<<tot-n;
	return 0;
}