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).
#####################################################################################################
'''     
                    Author--------
                    Name: Hemant Jain             Final Year Student
                    Poornima Institute of Engineering and Technology, Jaipur
                    
                    *******************Python Coder*************************
'''                                                                                
######################################################################################################

import sys
import time as mt,bisect,sys
import math
from sys import stdin,stdout
from collections import deque
from fractions import Fraction
from collections import Counter
from collections import OrderedDict


def si():   return int(sys.stdin.readline())                        #integer input
def st():   return stdin.readline()                                 #string input
def mi():   return map(int, sys.stdin.readline().split())           #multiple integer input 
def lis():  return list(map(int, sys.stdin.readline().split()))     #list input

def lcm(a,b):   return (a*b)//gcd(a,b)                              # to calculate lcm

def gcd(a,b):                                                       # to calculate gcd
    if a==0:
        return b
    elif b==0:
        return a
    if a>b:
        return gcd(a%b,b)
    else:
        return gcd(a,b%a)

test=si()
for _ in range(test):
    a,b=mi()
    result=abs(a-b)
    result=result/10
    print(math.ceil(result))






    
    
    