You are given two integers a and b.

In one move, you can choose some integer k from 1 to 10 and add it to a or subtract it from a. In other words, you choose an integer k ∈ [1; 10] and perform a := a + k or a := a - k. You may use different values of k in different moves.

Your task is to find the minimum number of moves required to obtain b from a.

You have to answer t independent test cases.

Input

The first line of the input contains one integer t (1 ≤ t ≤ 2 ⋅ 10^4) — the number of test cases. Then t test cases follow.

The only line of the test case contains two integers a and b (1 ≤ a, b ≤ 10^9).

Output

For each test case, print the answer: the minimum number of moves required to obtain b from a.

Example

Input


6
5 5
13 42
18 4
1337 420
123456789 1000000000
100500 9000


Output


0
3
2
92
87654322
9150

Note

In the first test case of the example, you don't need to do anything.

In the second test case of the example, the following sequence of moves can be applied: 13 → 23 → 32 → 42 (add 10, add 9, add 10).

In the third test case of the example, the following sequence of moves can be applied: 18 → 10 → 4 (subtract 8, subtract 6).
import java.util.*;
import java.io.*;
import java.text.*;
/**
 *
 * @author alanl
 */
public class Main{
    static BufferedReader input = new BufferedReader(new InputStreamReader(System.in));
    static StringTokenizer st;
    static PrintWriter pr = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
    public static void main(String[] args) throws IOException{
        int t = readInt();
        while(t-->0){
            int a = readInt(), b = readInt(), diff = a-b;
            System.out.println((long)(Math.ceil(Math.abs(diff/1.0/10))));
        }
    }
    static String next () throws IOException {
        while (st == null || !st.hasMoreTokens())
                st = new StringTokenizer(input.readLine().trim());
        return st.nextToken();
    }
    static long readLong () throws IOException {
        return Long.parseLong(next());
    }
    static int readInt () throws IOException {
        return Integer.parseInt(next());
    }
    static double readDouble () throws IOException {
        return Double.parseDouble(next());
    }
    static char readChar () throws IOException {
        return next().charAt(0);
    }
    static String readLine () throws IOException {
        return input.readLine().trim();
    }
    static long mod(long n, long mod){
        return(n%mod+mod)%mod;
    }
    static long pow(long n, long p, long mod){
        long ans = 1L;
        while(p>0){
            if(p%2!=0L)ans = mod(ans*n, mod);
            ans = mod(ans*ans, mod);
            p>>=1L;
        }
        return ans;
    }
    static long pow(long n, long p){
        long ans = 1L;
        while(p>0){
            if(p%2!=0L)ans*=n;
            ans*=ans;
            p>>=1L;
        }
        return ans;
    }
    static long gcd(long a, long b) {
        while(a!=0){
            long sub = a;
            a = b%a;
            b = sub;
        }
        return b;
    }
    static long lcm(long a, long b){
        return a/gcd(a, b)*b;
    }
    static boolean isPrime(int n){
        if(n<=1)return false;
        if(n<=3)return true;
        if(n%2==0||n%3==0)return false;
        for(int i = 5; i*i<=n; i+=6){
            if(n%i==0 || n%(i+2)==0)return false;
        }
        return true;
    }
    static int max(int a, int b) {
        return Math.max(a, b);
    }

    static int min(int a, int b) {
        return Math.min(a, b);
    }

    static void print(Object b) {
        System.out.print(b);
    }

    static void println(Object b) {
        System.out.println(b);
    }

    static void println() {
        System.out.println();
    }
    /* stuff you should look for
	* int overflow, array bounds
	* special cases (n=1?)
	* do smth instead of nothing and stay organized
	* WRITE STUFF DOWN
	* DON'T GET STUCK ON ONE APPROACH
    // Did you read the bounds?
    // Did you make typos?
    // Are there edge cases (N=1?)
    // Are array sizes proper (scaled by proper constant, for example 2* for koosaga tree)
    // Integer overflow?
    // DS reset properly between test cases?
    // Is using long longs causing TLE?
    // Are you using floating points?
    */
}
