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 \in [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 \le t \le 2 \cdot 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 \le a, b \le 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 \rightarrow 23 \rightarrow 32 \rightarrow 42$ (add $10$, add $9$, add $10$).

In the third test case of the example, the following sequence of moves can be applied: $18 \rightarrow 10 \rightarrow 4$ (subtract $8$, subtract $6$).
[{"code": "for _ in range(int(input())):\n    a,b=map(int,input().split())\n    print((abs(a-b)+9)//10)", "passed": true, "time": 0.14, "memory": 14236.0, "status": "done"}, {"code": "for _ in range(int(input())):\n    a,b = map(int,input().split())\n    print((abs(b - a) + 9) // 10)", "passed": true, "time": 0.14, "memory": 14328.0, "status": "done"}, {"code": "import sys\nimport math\ndef II():\n\treturn int(sys.stdin.readline())\n\ndef LI():\n\treturn list(map(int, sys.stdin.readline().split()))\n\ndef MI():\n\treturn map(int, sys.stdin.readline().split())\n\ndef SI():\n\treturn sys.stdin.readline().strip()\nt = II()\nfor q in range(t):\n\ta,b = MI()\n\tprint(math.ceil(abs(a-b)/10))", "passed": true, "time": 1.03, "memory": 14256.0, "status": "done"}, {"code": "for _ in range(int(input())):\n    a, b = list(map(int, input().split()))\n    print(-(-abs(a - b) // 10))\n", "passed": true, "time": 0.64, "memory": 14268.0, "status": "done"}, {"code": "#!/usr/bin/env pypy3\n\nimport math\n\nT = int(input())\nfor t in range(T):\n\tA, B = input().split()\n\tA = int(A)\n\tB = int(B)\n\tprint(math.ceil(abs(B-A)/10))", "passed": true, "time": 0.15, "memory": 14144.0, "status": "done"}, {"code": "t = int(input())\nfor _ in range(t):\n    a,b = list(map(int, input().split()))\n    ans = (abs(a-b)+9)//10\n    print(ans)\n", "passed": true, "time": 0.14, "memory": 14308.0, "status": "done"}, {"code": "t=int(input())\nfor you in range(t):\n    l=input().split()\n    a=int(l[0])\n    b=int(l[1])\n    z=abs(a-b)\n    print((z+9)//10)\n", "passed": true, "time": 0.14, "memory": 14388.0, "status": "done"}, {"code": "import sys\n# from collections import deque\n# from collections import Counter\n# from math import sqrt\n# from math import log\nfrom math import ceil\n# from bisect import bisect_left, bisect_right\n\n# alpha=['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']\n# mod=10**9+7\n# mod=998244353\n\n# def BinarySearch(a,x): \n# \ti=bisect_left(a,x) \n# \tif(i!=len(a) and a[i]==x): \n# \t\treturn i \n# \telse: \n# \t\treturn -1\n\n# def sieve(n): \n# \tprime=[True for i in range(n+1)]\n# \tp=2\n# \twhile(p*p<=n): \n# \t\tif (prime[p]==True): \n# \t\t\tfor i in range(p*p,n+1,p): \n# \t\t\t\tprime[i]=False\n# \t\tp+=1\n# \tprime[0]=False\n# \tprime[1]=False\n# \ts=set()\n# \tfor i in range(len(prime)):\n# \t\tif(prime[i]):\n# \t\ts.add(i)\n# \treturn s\n\n# def gcd(a, b):\n# \tif(a==0):\n# \t\treturn b \n# \treturn gcd(b%a,a)\n\nfast_reader=sys.stdin.readline\nfast_writer=sys.stdout.write\n\ndef input():\n\treturn fast_reader().strip()\n\ndef print(*argv):\n\tfast_writer(' '.join((str(i)) for i in argv))\n\tfast_writer('\\n')\n\n#____________________________________________________________________________________________________________________________________\n\nfor _ in range(int(input())):\n\ta,b=map(int, input().split())\n\tprint(ceil(abs(a-b)/10))", "passed": true, "time": 0.14, "memory": 14124.0, "status": "done"}, {"code": "import math\nfrom collections import deque\nfrom sys import stdin, stdout\nfrom string import ascii_letters\nimport sys\nletters = ascii_letters\ninput = stdin.readline\n#print = stdout.write\n\nfor i in range(int(input())):\n#for i in range(1):\n    a, b = list(map(int, input().split()))\n    print(abs(a - b) // 10 + (1 if abs(a - b) % 10 != 0 else 0))\n", "passed": true, "time": 0.14, "memory": 14072.0, "status": "done"}, {"code": "# map(int, input().split())\nrw = int(input())\nfor wewq in range(rw):\n   a, b = list(map(int, input().split()))\n   d = abs(a - b)\n   print((d + 9) // 10)\n\n\n\n", "passed": true, "time": 0.14, "memory": 14116.0, "status": "done"}]