import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

class RecycledNumbers{
	
	
	
	int getcount(int small,int large){
		int count = 0;
		for(int currnum = small; currnum < large; currnum++){
			int permut = currnum;
			int no_of_digits = 0;
			while(permut > 0){
				permut = permut/10;
				no_of_digits++;
			}
			int lastDigit = currnum % 10;
			permut = currnum / 10;
			permut = permut + lastDigit * (int)Math.pow(10, no_of_digits-1);
			while(permut != currnum){
				
				if(permut >= currnum && permut <= large){
					
					count++;
				}
				lastDigit = permut % 10;
				permut = permut / 10;
				permut = permut + lastDigit * (int)Math.pow(10, no_of_digits-1);
				
			}
			
		}
		
		return count;
	}
	
	public static void main(String args[]){
		RecycledNumbers d = new RecycledNumbers();
		
		int no_of_cases = 0;
		String input = "";
		
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		try{
			no_of_cases = Integer.parseInt(br.readLine());
		}
		catch(Exception e){
			System.out.println("First line is not a number");
		}
		
		for(int i=1; i <= no_of_cases;i++){
			try{
				input = br.readLine();
			}
			catch(Exception e){
				System.out.println("Number of test cases different from the number mentioned in first line");
			}
			
			System.out.print("Case #" +i+": ");
			
			StringTokenizer t =  new StringTokenizer(input);
			int small=0,large=0;
			if(t.hasMoreTokens()){
				small = Integer.parseInt(t.nextToken());
			}
			if(t.hasMoreTokens()){
				large = Integer.parseInt(t.nextToken());
			}
			System.out.println(d.getcount(small,large));
			
		}
		
		
		

	}
	
	
}
/**
 * 
 */
package code.google.codejam;

import java.util.HashSet;



/**
 * @author sunilkumarp
 *
 */
public class RecycledNumbers extends Template {
	
	int A = 0;
	
	int B = 0;
	
	int digits = 0;
	
	int[] n = null;
	
	int m = 0;

	/* (non-Javadoc)
	 * @see code.google.codejam.Template#doSolveProblem()
	 */
	@Override
	protected Object doSolveProblem() throws Exception {
		if (A >= B) {
			return 0;
		}
		int result = 0;
		n = new int[digits];
		int counter = digits;
		int A_ = A;
		for (;--counter >= 0;) {
			n[counter] = A_ % 10;
			A_ = A_ / 10;
		}
		
		counter = B - A;
		for (int i = 0; i < counter; ++i) {
			HashSet<Integer> unique = new HashSet<Integer>();
			for (int j = 1; j < digits; ++j) {
				if (isGreaterThanA(j) && isLessOrEqThanB(j)) {
					if(unique.add(m)) {
						++result;
					} continue;
					
				}
			}
			incrementA();
		}
		return result;
	}

	private boolean isLessOrEqThanB(int j) {
		return m <= B;
	}
	
	private boolean isGreaterThanA(int j) {
		m = 0;
		for (int k = j; k < digits; ++k) {
			m *= 10;
			m += n[k];
		}
		
		for (int k = 0; k < j; ++k) {
			m *= 10;
			m += n[k];
		}
		
		int A_ = 0;
		for (int k = 0; k < digits; ++k) {
			A_ *= 10;
			A_ += n[k];
		}
		
		return m > A_;
	}
	
	/*private boolean isLessOrEqThanB(int j) {
		boolean notSwitched = true;
		for (int i = 0; i < digits; ++i) {
			if (notSwitched && i+j == digits) {
				j = -i;
				notSwitched = false;
			}
			if (b[i] > a[i+j]) {
				return true;
			} else if (b[i] < a[i+j]) {
				return false;
			}
		}
		return true;
	}

	private boolean isGreaterThanA(int j) {
		boolean notSwitched = true;
		for (int i = 0; i < digits; ++i) {
			if (notSwitched && i+j == digits) {
				j = -i;
				notSwitched = false;
			}
			if (a[i] > a[i+j]) {
				return false;
			} else if (a[i] < a[i+j]) {
				return true;
			}
		}
		return false;
	}*/

	private void incrementA() {
		for (int i = digits - 1; i >= 0; --i) {
			if ((n[i] += 1) == 10) {
				n[i] = 0;
			} else {
				break;
			}
		}
		
	}

	/* (non-Javadoc)
	 * @see code.google.codejam.Template#printInput()
	 */
	@Override
	protected void printInput() throws Exception {
		System.out.println("Digits-" +digits + ":" + A + "-" + B);

	}

	/* (non-Javadoc)
	 * @see code.google.codejam.Template#initializeTestCase()
	 */
	@Override
	protected void initializeTestCase() throws Exception {
		readLine();
		A = readNextInteger();
		digits = linePointer;
		B = readNextInteger();
	}

}
