Campus

The new campus building of Byteburg University has $n$ floors, numbered from 1 to $n$ going up. Student rooms are located in several entrances.

In each entrance, floors whose number is a multiple of $k$ have $x$ rooms, and the remaining floors have $y$ rooms.

Rooms within an entrance are numbered with consecutive positive integers. The rooms on the first floor have the smallest numbers in that entrance, then come the rooms on the second floor, and so on. The rooms in the first entrance are numbered starting from 1, and in each following entrance room numbering starts with the number right after the largest room number in the previous entrance.

Figure 1 shows the room numbers in a building with $n = 7$ floors, 3 entrances, and parameters $k = 3$, $x = 2$, $y = 3$.

Figure 1. An example of room numbering in a building

To assign students to rooms, the campus administration must quickly determine the floor of a room from its number.

Given the numbers $n$, $k$, $x$, $y$ and a list of room numbers, write a program that determines the floor of each room.

The first line of the input file contains the positive integers $n$, $k$, $x$, $y$ ($1 \le n \le 10^9$, $1 \le k \le n$, $1 \le x, y \le 10^9$). Adjacent numbers are separated by exactly one space.

The second line of the input file contains the positive integer $q$, the number of room numbers whose floors must be determined ($1 \le q \le 1000$).

The third line contains $q$ integers $a_1, a_2, \ldots, a_q$, the room numbers ($1 \le a_i \le 10^{18}$). You may assume that the building has enough entrances that all rooms with the given numbers exist.

Print $q$ numbers, one per line. For each room number in the input file, print the number of the floor on which it is located.