#include <iostream>

using namespace std;

int main() {
    int n, k;
    cin >> n >> k;
    int a[k];
    for (int i = 0; i < k; i++)
        cin >> a[i];
    int L, R;
    cin >> L >> R;
    bool dp[n + 1][2];
    int pr[n + 1];
    dp[0][0] = dp[0][1] = pr[0] = 0;
    for (int i = 1; i <= n; i++) {
        dp[i][0] = 0;
        for (int j = 0; j < k; j++) {
            if (i >= a[j])
                dp[i][0] |= !dp[i - a[j]][1];
        }
        pr[i] = pr[i - 1] + dp[i][0];
        dp[i][1] = ((R >= i) || ((pr[i - L] - pr[i - R - 1]) != (R - L + 1)));
    }
    cout << (dp[n][0] ? 1 : 2);
}