#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <unordered_set>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
#define GET_MACRO(_1, _2, _3, NAME, ...) NAME
#define _rep(i, n) _rep2(i, 0, n)
#define _rep2(i, a, b) for(int i = (int)(a); i < (int)(b); i++)
#define rep(...) GET_MACRO(__VA_ARGS__, _rep2, _rep)(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using i64 = long long;
template<class T, class U>
bool chmin(T& a, const U& b) { return (b < a) ? (a = b, true) : false; }
template<class T, class U>
bool chmax(T& a, const U& b) { return (b > a) ? (a = b, true) : false; }

template<typename T>istream& operator>>(istream&i,vector<T>&v){rep(j,v.size())i>>v[j];return i;}
template<typename T>string join(vector<T>&v){stringstream s;rep(i,v.size())s<<' '<<v[i];return s.str().substr(1);}
template<typename T>ostream& operator<<(ostream&o,vector<T>&v){if(v.size())o<<join(v);return o;}
template<typename T>string join(vector<vector<T>>&vv){string s="\n";rep(i,vv.size())s+=join(vv[i])+"\n";return s;}
template<typename T>ostream& operator<<(ostream&o,vector<vector<T>>&vv){if(vv.size())o<<join(vv);return o;}

vector<i64> v;
vector memo(501, vector(501, vector(501, -1)));
int n, k;

int solve(int now, int a, int b)
{
    if (a > b) swap(a, b);
    if (memo[now][a][b] != -1) return memo[now][a][b];
    if (now == n) return memo[now][a][b] = 0;
    int res = 0;
    if ((v[now] + a + b) % k == 0) res = 1;
    res += max({solve(now + 1, a, b), solve(now + 1, a, v[now]), solve(now + 1, b, v[now])});
    return memo[now][a][b] = res;
}

int main()
{
    i64 x, y;
    cin >> n >> k >> x >> y;
    v.resize(n);
    cin >> v;
    x %= k;
    y %= k;
    rep(i, n) v[i] %= k;
    cout << solve(0, x, y);
}