Gym104081E

#include<iostream>
#include<vector>
using namespace std;
typedef long long ll;
ll n,k,x,t,d,m;
ll i,j;
void solve ()
{
    cin>>x>>t>>k>>n>>d;
    vector<ll> a(2*n+1);
    for(i=0;i<n;i++)
    {
        cin>>a[i];
        if(a[i]<=d) {a[i]=a[i+n]=-1;}
        else {a[i]=a[i+n]=1;}
    }
    ll c1,f,x1;
    c1=f=0;
    x1=x;
    for(i=0;i<2*n;i++)
    {
        x+=a[i];
        if(x<=k)
            c1++;
        else c1=0;
        if(c1==t)
        {
            cout<<"YES"<<endl;
            return ;
        }
    }
    if(x1>x||(x1==x&&c1==2*n)) cout<<"YES"<<endl;
    else cout<<"NO"<<endl;
    }
int main() {
    cin.tie(0);
    ios::sync_with_stdio(0);
    cout.tie(0);
std::cin>>m;
while(m--)
{
   solve();
}
return 0;
}
/*泛舟沧海，立马昆仑*/
/*若你为了错过太阳而哭泣，那么你也将错过群星了*/
/*红了樱桃，绿了芭蕉*/

究极无敌超时题