#include <bits/stdc++.h>
using namespace std;
void itval(istream_iterator<string> it) {}
template <typename T, typename... Args>
void itval(istream_iterator<string> it, T a, Args... args) {
  cerr << *it << " = " << a << endl;
  itval(++it, args...);
}
const long long int MOD = 1e9 + 7;
template <typename T>
inline void print(T x) {
  cout << x << "\n";
}
template <typename T>
inline void printvec(T x) {
  for (auto a : x) cout << a << ' ';
  cout << '\n';
}
struct custom {
  bool operator()(const pair<long long int, long long int> &p1,
                  const pair<long long int, long long int> &p2) const {
    return p1.first < p2.first;
  }
};
long long int get_pow(long long int a, long long int b, long long int M = MOD) {
  long long int res = 1;
  while (b) {
    if (b & 1) res = (res * a) % M;
    a = (a * a) % M;
    b >>= 1;
  }
  return res;
}
const long long int N = 100 + 5, inf = 4e18;
long long int a[N][N], b[N][N];
long long int n, m, k;
void multiply(long long int m, long long int power) {
  long long int c[N][N];
  if (power == 1 || power == 0) {
    return;
  }
  multiply(m, power / 2);
  for (long long int i = (long long int)0; i < (long long int)(m); i++) {
    for (long long int j = (long long int)0; j < (long long int)(m); j++) {
      long long int z = 0;
      for (long long int k = (long long int)0; k < (long long int)(m); k++) {
        z += (a[i][k] * a[k][j]) % MOD;
        z %= MOD;
      }
      c[i][j] = z;
    }
  }
  for (long long int i = (long long int)0; i < (long long int)(m); i++) {
    for (long long int j = (long long int)0; j < (long long int)(m); j++)
      a[i][j] = c[i][j];
  }
  if (power & 1) {
    for (long long int i = (long long int)0; i < (long long int)(m); i++) {
      for (long long int j = (long long int)0; j < (long long int)(m); j++) {
        long long int z = 0;
        for (long long int k = (long long int)0; k < (long long int)(m); k++) {
          z += (a[i][k] * b[k][j]) % MOD;
          z %= MOD;
        }
        c[i][j] = z;
      }
    }
    for (long long int i = (long long int)0; i < (long long int)(m); i++) {
      for (long long int j = (long long int)0; j < (long long int)(m); j++)
        a[i][j] = c[i][j];
    }
  }
}
long long int cnt[10];
void solve() {
  long long int n, p, k, x, u;
  cin >> n >> p >> k >> x;
  for (long long int i = (long long int)0; i < (long long int)(n); i++) {
    cin >> u;
    cnt[u]++;
  }
  for (long long int i = (long long int)0; i < (long long int)(x); i++) {
    for (long long int j = (long long int)1; j < (long long int)(10); j++) {
      a[i][(i * 10 + j) % x] += cnt[j];
    }
  }
  for (long long int i = (long long int)0; i < (long long int)(x); i++)
    for (long long int j = (long long int)0; j < (long long int)(x); j++)
      b[i][j] = a[i][j];
  multiply(x, p);
  long long int ans = a[0][k];
  cout << ans;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int test = 1;
  clock_t z = clock();
  for (long long int tes = (long long int)0; tes < (long long int)(test);
       tes++) {
    solve();
  }
  fprintf(stderr, "Total Time:%.4f\n", (double)(clock() - z) / CLOCKS_PER_SEC),
      fflush(stderr);
  return 0;
}
