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 
from collections import defaultdict as dc
from heapq import *
import math
import bisect
import sys
from collections import deque as dq
from heapq import heapify,heappush,heappop
mod=10**9 +7
def inp(): 
    p=int(input())
    return p
def line():
    p=list(map(int,input().split()))
    return p
def read_mat():
    n=inp()
    a=[]
    for i in range(n):
        a.append(line())
    return a
def digit(n):
    s=str(n)
    p=0
    for i in s:
        p+=(int(i))**2
    return p
def check(l,r):
    ans=0
    c=0
    for i in range(l,r+1):
        if (i%a)%b!=(i%b)%a:
            ans+=1
        else:
            #print(i,end=' ')
            c+=1
    #print(c)
    return ans
def solve(l,r,a,b,p):
    if r<max(a,b):
        return 0
    if l==r:
        if (l%a)%b==(l%b)%a:
            return 0
        return 1
    x=max(p*((l//p)+1),1)
    tot=r-l+1
    y=max((p*(r//p)),l)
    extra=0
    #print(p,x,y)
    for i in range(l,min(l+b,x,r+1)):
            if (i%a)%b==(i%b)%a:
                #print(i,end=' ')
                extra+=1    
            else:
                break
    if l!=y:
        for i in range(y,min(r+1,y+b),1):
            if (i%a)%b==(i%b)%a:
                #print(i,end=' ')
                extra+=1
            else:
                break
    rem=((y-x)//p)*b if (y-x) >=0 else 0
    return tot-(rem+extra)
for _ in range(inp()):
    a,b,q=line()
    ans=[]
    x=min(a,b)
    y=max(a,b)
    p=(a*b)//(math.gcd(a,b))
    for i in range(q):
        l,r=line()
        t=solve(l,r,x,y,p)
        #print(check(l,r))
        ans.append(t)
    print(*ans)