#include <bits/stdc++.h>
using namespace std;
int dx[] = {0, 0, 1, -1, -1, -1, 1, 1};
int dy[] = {1, -1, 0, 0, -1, 1, 1, -1};
template <class T>
inline T biton(T n, T pos) {
  return n | ((T)1 << pos);
}
template <class T>
inline T bitoff(T n, T pos) {
  return n & ~((T)1 << pos);
}
template <class T>
inline T ison(T n, T pos) {
  return (bool)(n & ((T)1 << pos));
}
template <class T>
inline T gcd(T a, T b) {
  while (b) {
    a %= b;
    swap(a, b);
  }
  return a;
}
inline int nxt() {
  int aaa;
  scanf("%d", &aaa);
  return aaa;
}
inline long long lxt() {
  long long aaa;
  scanf("%lld", &aaa);
  return aaa;
}
inline double dxt() {
  double aaa;
  scanf("%lf", &aaa);
  return aaa;
}
template <class T>
inline T bigmod(T p, T e, T m) {
  T ret = 1;
  for (; e > 0; e >>= 1) {
    if (e & 1) ret = (ret * p) % m;
    p = (p * p) % m;
  }
  return (T)ret;
}
template <class T>
ostream& operator<<(ostream& os, const set<T>& input) {
  bool isFirst = true;
  for (T out : input) {
    if (isFirst) {
      os << out;
      isFirst = false;
    } else
      os << " " << out;
  }
  return os;
}
int n, m, b, M;
vector<int> v;
int dp[505][505];
inline void MOD(int& a, int b) {
  a += b;
  if (a >= M) a -= M;
}
int F() {
  for (int i = 0; i < n; i++) {
    for (int pos = 0; pos < m; pos++) {
      for (int k = 0; k + v[i] <= b; k++) {
        MOD(dp[pos + 1][k + v[i]], dp[pos][k]);
      }
    }
  }
  return dp[m][b];
}
void solve() {
  n = nxt(), m = nxt(), b = nxt(), M = nxt();
  for (int i = 0; i < n; i++) v.emplace_back(nxt());
  fill(dp[0], dp[0] + b + 1, 1);
  printf("%d\n", F());
}
int main() {
  cout.setf(ios::fixed);
  cout.precision(10);
  int tc = 1;
  while (tc--) {
    solve();
  }
  return 0;
}
