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 
input = raw_input

from fractions import gcd

def calc_diff_num(nums, lcd, innum):
    r = innum // lcd
    q = innum % lcd
    ret = nums[lcd-1] * r + nums[q]
    return ret


def answer():
    a, b, q = map(int, input().split(" "))
    g = gcd(a, b)
    lcd = a * b // g

    
    cur = 0
    nums = [0] * lcd
    for val in range(0, lcd):
        i = val
        out1 = ((val) % a) % b
        out2 = ((val) % b) % a
        if out1 != out2:
            cur += 1
        nums[i] = cur



    for i in range(q):
        l, r = map(int, input().split(" "))
        tmp1 = calc_diff_num(nums, lcd, l-1)
        tmp2 = calc_diff_num(nums, lcd, r)
        print tmp2-tmp1,
    print


t = int(input())
for _ in range(t):
    out = answer()