#include <iostream>#include <cstring>using namespace std;const int MAX_N = 100 + 10;int dp[MAX_N][MAX_N];int a[MAX_N];int l,n,x,y;int main(){ while(cin >> l >> n >> x >> y) { for(int i = 1;i <= n;i++) cin >> a[i]; memset(dp,0,sizeof(dp)); for(int i = 1;i <= n;i++) { for(int j = 0;j <= i;j++) { if(j == 0) { dp[i][j] = dp[i - 1][j]; if(l >= a[i]) dp[i][j]++; } else if(i <= j + x - 1 && i != j) { dp[i][j] = dp[i - 1][j]; if(l + 1 >= a[i] && a[i] <= 5) dp[i][j]++; } else if(i > j + x - 1 && i <= j + x + y - 1 && i != j) { dp[i][j] = dp[i - 1][j]; if(0 >= a[i]) dp[i][j]++; } else if(i == j) { int last = max(0,j - ((i + x + y - 1) - i + 1)); for(;last >= 0;last--) dp[i][j] = max(dp[i - 1][last],dp[i][j]); if(l + 1 >= a[i] && a[i] <= 5) dp[i][j]++; } else { dp[i][j] = dp[i - 1][j]; if(l >= a[i]) dp[i][j]++; } } } int _max = 0; for(int j = 0;j <= n;j++) _max = max(dp[n][j],_max); cout << _max << endl; } return 0;}
