You are given two integers a and b, and q queries. The i-th query consists of two numbers l_i and r_i, and the answer to it is the number of integers x such that l_i ≤ x ≤ r_i, and ((x mod a) mod b) ≠ ((x mod b) mod a). Calculate the answer for each query.

Recall that y mod z is the remainder of the division of y by z. For example, 5 mod 3 = 2, 7 mod 8 = 7, 9 mod 4 = 1, 9 mod 9 = 0.

Input

The first line contains one integer t (1 ≤ t ≤ 100) — the number of test cases. Then the test cases follow.

The first line of each test case contains three integers a, b and q (1 ≤ a, b ≤ 200; 1 ≤ q ≤ 500).

Then q lines follow, each containing two integers l_i and r_i (1 ≤ l_i ≤ r_i ≤ 10^{18}) for the corresponding query.

Output

For each test case, print q integers — the answers to the queries of this test case in the order they appear.

Example

Input


2
4 6 5
1 1
1 3
1 5
1 7
1 9
7 10 2
7 8
100 200


Output


0 0 0 2 4 
0 91 
import sys
input=sys.stdin.readline
from math import *
t=int(input())
def bo(x):
    global a,b,l

    if x==0:
        return 0
    h=x//l

    u=0
    if h>0:
        u+=(h)*max(a,b) 
        u-=1
    #print(u)
    if h!=0:
        u+=(min(max(a,b),x+1-h*l))
    else:
         u+=(min(max(a,b),x-h*l))
        
    #print(u,h)
    if h==0 and max(a,b)<=x-h*l:
        u-=1
    
    return x-u
while t>0:
    t-=1
    a,b,q=map(int,input().split())
    g=gcd(a,b)
    l=(a*b)//g
    #print(l)
    for _ in range(q):
        x,y=map(int,input().split())
        if g==min(a,b):
            print(0,end=" ")
        else:
            #print(bo(y),bo(x-1))
            print(bo(y)-bo(x-1),end=" ")
        
    print()   