CodeForces Round #515 Div.3 A. Vova and Train

http://codeforces.com/contest/1066/problem/A

 

Vova plans to go to the conference by train. Initially, the train is at the point $\mathrm{11 and\; the\; destination\; point\; of\; the\; path\; is\; the\; point LL.\; The\; speed\; of\; the\; train\; is 11 length\; unit\; per\; minute\; (i.e.\; at\; the\; first\; minute\; the\; train\; is\; at\; the\; point 11,\; at\; the\; second\; minute\; —\; at\; the\; point 22 and\; so\; on).}$

There are lanterns on the path. They are placed at the points with coordinates divisible by $\mathrm{vv (i.e.\; the\; first\; lantern\; is\; at\; the\; point vv,\; the\; second\; is\; at\; the\; point 2v2v and\; so\; on).}$

There is also exactly one standing train which occupies all the points from $\mathrm{ll to rr inclusive.}$

Vova can see the lantern at the point $\mathrm{pp if pp is\; divisible\; by vv and\; there\; is\; no\; standing\; train\; at\; this\; position\; (p\notin [l;r]p\notin [l;r]).\; Thus,\; if\; the\; point\; with\; the\; lantern\; is\; one\; of\; the\; points\; covered\; by\; the\; standing\; train,\; Vova\; can\text{'}t\; see\; this\; lantern.}$

Your problem is to say the number of lanterns Vova will see during the path. Vova plans to go to $\mathrm{tt different\; conferences,\; so\; you\; should\; answer tt independent queries.}$

Input

The first line of the input contains one integer $\mathrm{tt (1\le t\le 1041\le t\le 104)\; —\; the\; number\; of\; queries.}$

Then $\mathrm{tt lines\; follow.\; The ii-th\; line\; contains\; four\; integers Li,vi,li,riLi,vi,li,ri (1\le L,v\le 1091\le L,v\le 109, 1\le l\le r\le L1\le l\le r\le L)\; —\; destination\; point\; of\; the ii-th\; path,\; the\; period\; of\; the\; lantern\; appearance\; and\; the\; segment\; occupied\; by\; the\; standing\; train.}$

Output

Print $\mathrm{tt lines.\; The ii-th\; line\; should\; contain\; one\; integer\; —\; the\; answer\; for\; the ii-th\; query.}$

Example

input

Copy

4
10 2 3 7
100 51 51 51
1234 1 100 199
1000000000 1 1 1000000000

output

Copy

3
0
1134
0

Note

For the first example query, the answer is $\mathrm{33.\; There\; are\; lanterns\; at\; positions 22, 44, 66, 88 and 1010,\; but\; Vova\; didn\text{'}t\; see\; the\; lanterns\; at\; positions 44and 66 because\; of\; the\; standing\; train.}$

For the second example query, the answer is $\mathrm{00 because\; the\; only\; lantern\; is\; at\; the\; point 5151 and\; there\; is\; also\; a\; standing\; train\; at\; this\; point.}$

For the third example query, the answer is $\mathrm{11341134 because\; there\; are 12341234 lanterns,\; but\; Vova\; didn\text{'}t\; see\; the\; lanterns\; from\; the\; position 100100 to\; the\; position 199199 inclusive.}$

For the fourth example query, the answer is $\mathrm{00 because\; the\; standing\; train\; covers\; the\; whole\; path.}$

 

#include <bits/stdc++.h>
using namespace std;

int T;
int L, v, l, r;
int cnt;

int main() {
    scanf("%d", &T);
    while(T --) {
        cnt = 0;
        scanf("%d%d%d%d", &L, &v, &l, &r);
        cnt = L / v - r / v + (l - 1) / v;
        printf("%d\n", cnt);
    }
    return 0;
}