Everyone has got to know that HELL and Printf{} use cheats while playing Counter-Strike 1.6. Everyone decides to give them a punishment. They are going to be made to paint all the rooms of the ground floor of the hostel.
There are a total of N rooms on the ground floor arranged in a single row side by side numbered from 1 to N. HELL has to paint all the rooms with room numbers 1 to K (both inclusive) and Printf{} has to paint all the rooms with room numbers K+1 to N (both inclusive).
Both are given a total of 10 paints of distinct colours, 1 of them being White colour. They have to paint all the rooms such that atleast one of the rooms painted by each one of them is not White in colour so that the hostel ground floor has a minimum of two colourful (non-White) rooms.
Given N and K, you have to report the total number of different possible appearances of the hostel ground floor ie. , total number of different ways in which all the rooms of the ground floor can be painted. Assume that there is infinite amount of paint of each colour made available to both of them.
Input :
The first line comprises of T denoting the number of test cases. The next T lines are such that each line consists of 2 space separated integers N and K.
Output :
Print a single integer , the answer to each test case on a new line.
Constraints:
1<=T<=5
2<=N<=100000
1<=K<N
Author : Shreyans
Tester : Sayan
