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 
/*
 *  Created by Andrei Arhire 18/09/2020
 *  Copyright © 2020 Andrei Arhire. All rights reserved.
 */

import java.util.*;
import java.io.*;

public class Main {

    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        Task solver = new Task();
        solver.solve(in, out);
        out.close();
    }

    static class Task   {
        long n, t , sw , a , b , q , x , y ;
        int NR = (int)(1e5+10);
        long[] p = new long[NR] ;

        public void solve (InputReader in, PrintWriter out)   {
            int i ;
            t = in.nextLong() ;
            for ( long t1 = 1 ; t1 <= t ; ++ t1 )    {
                a = in.nextLong();
                b = in.nextLong();
                q = in.nextLong();
                for ( i = 1 ; i <= a * b ; ++ i )   {
                    p [ i ] = 0 ;
                    if ( ( i % a ) % b != ( i % b ) % a )   {
                        ++ p [ i ] ;
                    }
                    p [ i ] += p [ i - 1 ] ;
                }
                for ( long q1 = 1 ; q1 <= q ; ++ q1 )    {
                    x = in.nextLong() ;
                    y = in.nextLong() ;
                    out.print ( (query(y)-query(x-1)) ) ;
                    out.print ( " " ) ;
                }
                out.print("\n");
            }
        }
        long query ( long x ) {
            return ((x/(a*b)))*p[(int)(a*b)]+p[(int)((long)(x%(a*b)))];
        }
    }


    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public long nextInt() {
            return Integer.parseInt(next());
        }
        public long nextLong() {
            return Long.parseLong(next());
        }
    }

}