Problem: 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 

Solution (in PYTHON3):

Solution:
from collections import deque
from collections import OrderedDict
import math
#data = sys.stdin.readlines()
import sys
import os
from io import BytesIO

 
 
#input = sys.stdin.readline
#sys.setrecursionlimit(200005) 
 
#print((9%3)%5)
numbar=0
for t in range(int(input())):
    a,b,q = map(int,input().split())
    ab = a*b
    isTrue = [0]*(ab+1)
    preFixSum = [0]*(ab+1)
    countO = 0;
    for i in range(1, ab+1):
        val1 = (i%a)%b
        val2 = (i%b)%a
        if val1!=val2:
            countO+=1
            isTrue[i]=1
        #print(val1, val2)
    for i in range(1,len(preFixSum)):
        preFixSum[i]=preFixSum[i-1]+isTrue[i]
        #print(preFixSum[i])
    for q1 in range(q):
        l,r = map(int, input().split())
        answer = 0
       # if(r<=ab*3):
          #  for i in range(l, r+1):
               # answer+=isTrue[i%ab]
           # print(answer)
          #  continue  
        sumL = 0
        sumR = 0 
        if (r-l<=ab):
         #   for i in range(l, r+1):1
              #  answer+=isTrue[i%ab]
            #print(answer)
            
            #sumL=preFixSum[ab]-preFixSum[(l%ab)-1]
            distation = ab-(l%ab)
            #print(ab%l)
            #print(distation)
           # sys.exit(0)
            if r%ab==0:
                answer+=preFixSum[ab]-preFixSum[(l%ab)-1]
            elif l%ab==0:
                answer=preFixSum[r%ab]
            elif r-l<=distation:
                answer=preFixSum[r%ab]-preFixSum[(l%ab)-1]
            else:
                answer=preFixSum[ab]-preFixSum[(l%ab)-1]+preFixSum[r%ab]
            try:
                if numbar==7266 and l<-99999:
                    raise Exception
            except Exception:
                print(str(l)+"-"+str(r)+"-"+str(a)+"-"+str(b))
            numbar+=1
            #492-552-2-41
            print(answer)
            continue
        coutNumber  = r//ab-l//ab;
        if l%ab!=0:
            sumL=preFixSum[ab]-preFixSum[(l%ab)-1]
            coutNumber-=1
        if r%ab!=0:
            sumR = preFixSum[r%ab]
       # print(l%ab, r%ab, sumL, sumR)
        
        if(coutNumber>0):
            answer+=countO*coutNumber
        numbar+=1
        print(answer+sumL+sumR)