#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; #define int long long #define I32_MAX 2147483647 #define I64_MAX 9223372036854775807LL #define I64_MAX2 1223372036854775807LL #define INF I64_MAX2 #define MOD 1000000007 #define MEM_SIZE 10000 #define DEBUG_OUT true #define ALL(x) (x).begin(), (x).end() template void DEBUG(T e){if(DEBUG_OUT == false)return; std::cout << e <<" ";} template void DEBUG(const std::vector& v){if(DEBUG_OUT == false)return;for(const auto& e : v){std::cout<< e << " "; } std::cout << std::endl;} template void DEBUG(const std::vector >& vv){if(DEBUG_OUT == false)return;for(const auto& v : vv){ DEBUG(v); } } template void DEBUG(T d, Ts... e){if(DEBUG_OUT == false)return;DEBUG(d);DEBUG(e...);} template void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; abort();}} template< typename T1, typename T2 > inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); } template< typename T1, typename T2 > inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); } void solve(void) { int N,K,X,Y; cin>>N>>K>>X>>Y; vector vec (N,0); for (int i = 0; i < N; i++) { int X;cin>>X; X--; vec[i] = X/K +(X%K>0); } if(X >= Y) { cout<0); if(T < N) N_Y= vec[T-1]; else { T = N -1; } int N_X = 0; for (int i = T; i < N; i++) { N_X += vec[i] - N_Y; } // DEBUG(vec); // DEBUG(T,N_Y,N_X); cout<