import sys
import math
MOD = 10**9 + 7

def main():
    p, n, k, b = map(int, sys.stdin.readline().split())
    a_list = list(map(int, sys.stdin.readline().split()))
    
    # Precompute x^k mod p for all x in 0..p-1
    freq = [0] * p
    for x in range(p):
        y = pow(x, k, p)
        freq[y] += 1
    
    # Precompute inverse for all possible a_i (non-zero)
    inv = [1] * p
    for a in range(1, p):
        inv[a] = pow(a, p-2, p)
    
    # Compute contribution counts for each term
    cnt_list = []
    for a in a_list:
        if a == 0:
            cnt = [0] * p
            cnt[0] = p
            cnt_list.append(cnt)
            continue
        inv_a = inv[a]
        cnt = [0] * p
        for r in range(p):
            y = (r * inv_a) % p
            cnt[r] = freq[y]
        cnt_list.append(cnt)
    
    # Initialize DP
    dp = [0] * p
    dp[0] = 1
    
    # Convolve each term's contribution using FFT-based convolution
    for cnt in cnt_list:
        new_dp = [0] * p
        for r in range(p):
            if dp[r] == 0:
                continue
            for s in range(p):
                new_r = (r + s) % p
                new_dp[new_r] = (new_dp[new_r] + dp[r] * cnt[s]) % MOD
        dp = new_dp
    
    print(dp[b] % MOD)

if __name__ == '__main__':
    main()