Vova and Train【思维】

Vova plans to go to the conference by train. Initially, the train is at the point 1and the destination point of the path is the point L. The speed of the train is 1length unit per minute (i.e. at the first minute the train is at the point 1, at the second minute — at the point 2 and so on).

There are lanterns on the path. They are placed at the points with coordinates divisible by v (i.e. the first lantern is at the point v, the second is at the point 2v and so on).

There is also exactly one standing train which occupies all the points from l to inclusive.

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

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

Input

The first line of the input contains one integer tt (1t10^4) — the number of queries.

Then tt lines follow. The i-th line contains four integers Li,vi,li,ri (1L,v10^9lrL) — destination point of the i-th path, the period of the lantern appearance and the segment occupied by the standing train.

Output

Print tt lines. The i-th line should contain one integer — the answer for the i-th query.

Example

Input
4
10 2 3 7
100 51 51 51
1234 1 100 199
1000000000 1 1 1000000000
Output
3
0
1134
0

Note

For the first example query, the answer is 3. There are lanterns at positions 2468 and 10, but Vova didn't see the lanterns at positions 44 and 66 because of the standing train.

For the second example query, the answer is 0 because the only lantern is at the point 51 and there is also a standing train at this point.

For the third example query, the answer is 1134 because there are 1234 lanterns, but Vova didn't see the lanterns from the position 100 to the position 199 inclusive.

For the fourth example query, the answer is 0 because the standing train covers the whole path.

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
int main()
{
int t=0;
cin>>t;
while(t--)
{
ll L=0,v=0,start=0,end=0,sum=0;
scanf("%lld%lld%lld%lld",&L,&v,&start,&end);
int i=0;
sum=(start-1)/v;
sum+=L/v-end/v;
printf("%lld\n",sum);
}
}