#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;}

int main()
{
    int n, k, x, y;
    cin >> n >> k >> x >> y;
    vector<int> a(n);
    cin >> a;
    x %= k;
    y %= k;
    rep(i, n) a[i] %= k;
    vector dp(n + 1, vector(k, vector<int>(k, -1e9)));
    dp[0][x][y] = dp[0][y][x] = 0;
    rep(i, n)
    {
        rep(j, k)
        {
            rep(l, k)
            {
                if ((j + l + a[i]) % k == 0)
                {
                    dp[i][j][l]++;
                }
            }
        }
        rep(j, k)
        {
            rep(l, k)
            {
                chmax(dp[i + 1][a[i]][l], dp[i][j][l]);
                chmax(dp[i + 1][l][a[i]], dp[i][j][l]);
                chmax(dp[i + 1][j][a[i]], dp[i][j][l]);
                chmax(dp[i + 1][a[i]][j], dp[i][j][l]);
            }
        }
    }
    int ans = 0;
    rep(i, k) rep(j, k) chmax(ans, dp[n][i][j]);
    cout << ans << endl;
}