#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
	ll n,k,x,y;
	scanf("%lld%lld%lld%lld",&n,&k,&x,&y);
	ll q;
	ll buildBlock = (n-n/k)*y+(n/k)*x;
	ll floorBlock = (k-1)*y+x;
	scanf("%lld",&q);
	while(q--){
		ll a,ans=0;
		scanf("%lld",&a);
		a=(a-1)%buildBlock+1;
		ans += (a-1)/floorBlock*k;
		a=(a-1)%floorBlock+1;
		ans += (a-1)/y+1;
		printf("%lld\n",ans);
	}
	return 0;
}

话说我感觉这场比赛第二题比第一题简单（