DA-IICT Intra Programming Contest 07

Note: there is slight change in constraints, F<G has been removed.
Nawaab is playing flappy bird, there is 2-dimensional map and bird is flying in this map. Here height is positive Y-axis and bird is moving in positive X-axis direction.


Initially bird is at starting point(X=0) and at the height of H meters(Y=H). Bird is moving with some constant velocity and there is no acceleration(or gravity). There are 2 velocities associated with bird one in positive X direction (always 1 meter/sec) and another in negative Y direction or downwards(V meter/s).    


Now there are N obstacles in the path of bird. One obstacle consist of two pillars upper-pillar and lower-pillar and there is some gap between 2 pillars(G meters), in order to pass the obstacle bird had to pass through the gap. The height of i-th lower-pillar is ph[i] meters, distance from origin is d[i] and width is negligible. Note that to pass obstacle bird has to be above lower-pillar and below upper-pillar, it cannot pass by just touching the pillars(i.e. if lower-pillar height is x meters than height of bird while crossing obstacle must be greater than x and less than x+G, it cannot be equal to x or x+G).


Now comes the Role of Nawab, he taps the screen to make bird jump. Whenever nawab taps the screen, bird is displaced by F meters upwards(positive Y direction).Note that tapping does not affect the velocity.     


Your target is find the total number of minimum taps required for each obstacles. Total number of taps required for i-th obstacle is taps done after (i-1)th obstacle and before ith obstacle. If it is impossible to pass an obstacle print "Game Over" and do not print anything after that for further obstacles. 


 
INPUT FORMAT:

First line contains V, H, F, G, N.

Then follows N lines (details of N obstacles)

each line of ith obstacle contains two variable d[i] and ph[i].



OUTPUT FORMAT:

output N lines each line containing total number of minimum taps required for ith obstacle.     



CONSTRAINTS:

V,H,F,G,N, d[i], ph[i] are all integers <1000

d[i+1]>d[i].



Example:


INPUT

3 10 5 7 3

10 5

15 30

25 10



OUTPUT

6

8

2