#include <iostream>
#include <vector>
#include <algorithm>
typedef long long ll;
using namespace std;
const ll MOD=1e9+7;
ll powmod(ll a, ll k, ll mod){
	if(a==0) return 0;
    ll ap=a, ans=1;
    while(k){
        if(k&1){
            ans*=ap;
            ans%=mod;
        }
        ap=ap*ap;
        ap%=mod;
        k>>=1;
    }
    return ans;
}
ll inv(ll a, ll mod){
    return powmod(a, mod-2, mod);
}
ll gcd(ll a, ll b){
	if(b==0) return a;
	return gcd(b, a%b);
}
int main()
{
    int n, k; ll b, p;
	cin>>p>>n>>k>>b;
	vector<ll> a(n);
	k=gcd(k, p-1);
	for(int i=0; i<n; i++) cin>>a[i];
	ll r;
	for(r=1; r<p; r++){
		bool dame=0;
		ll pp=1;
		for(int i=0; i<p-2; i++){
			(pp*=r)%=p;
			if(pp==1){
				dame=1; break;
			}
		}
		if(!dame) break;
	}
	vector<ll> q(p-1);
	vector<int> qi(p);
	q[0]=1;
	for(int i=1; i<p-1; i++) q[i]=q[i-1]*r%p;
	for(int i=0; i<p-1; i++) qi[q[i]]=i%k;
	vector<ll> dp(p);
	dp[0]=1;
	for(int i=0; i<n; i++){
	    vector<ll> tmp=dp;
		vector<ll> s(k);
		for(int j=0; j<p; j++){
			int x=j+a[i];
			if(x>=p) x-=p;
			if(x==0) (tmp[0]+=dp[j]*(p-1))%=MOD;
			else (s[qi[x]]+=dp[j]*k)%=MOD;
		}
		for(int j=1; j<p; j++){
			tmp[j]+=s[qi[j]];
			if(tmp[j]>=MOD) tmp[j]-=MOD;
		}
		swap(tmp, dp);
	}
	cout<<dp[b]<<endl;
    return 0;
}