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:
#codingalways

import io, sys, atexit, os
import math as ma
from sys import exit
from decimal import Decimal as dec
from itertools import permutations
from itertools import combinations


def li():
    return list(map(int, sys.stdin.readline().split()))


def num():
    return map(int, sys.stdin.readline().split())


def nu():
    return int(input())


def find_gcd(x, y):
    while (y):
        x, y = y, x % y
    return x


def lcm(x, y):
    gg = find_gcd(x, y)
    return (x * y // gg)


mm = 1000000007
def count(x,lcm,big):
    p=x//lcm
    hot=p*lcm
    done=x
    if(p!=0):
        done-=min(big,x-hot+(1 if p!=0 else 0))
    done-=(p-1)*big if p!=0 else 0
    return done


def solve():
    t = nu()
    for tt in range(t):
        a,b,q=num()
        lc = lcm(a, b)
        big=max(a,b)
        for i in range(q):
            l, r = num()
            if(find_gcd(a,b)==min(a,b)):
                print(0,end=" ")
                continue
            if(r<big):
                print(0, end=" ")
                continue
            hola=count(r,lc,big)
            l=max(l,big)
            if(l>1):
                hola-=count(l-1,lc,big)
            print(hola,end=" ")
        print("")












if __name__ == "__main__":
    solve()