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));
			
		}
		
		
		

	}
	
	
}
import java.util.Scanner;

public class test {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		int T = sc.nextInt();
		int casenum = 1;
		
		while (T-- > 0) {
			 int num = solve(sc);
			 System.out.println("Case #" + casenum++ + ": " + num);
		}

	}

	private static int solve(Scanner sc) {
		int A = Integer.parseInt(sc.next());
		int B = Integer.parseInt(sc.next());
		long ts = System.currentTimeMillis();
		int num = 0;
		for (int a = A; a < B; a++) {
			for (int b = a+1; b <= B; b++) {
				
					if(isrec(a,b)) {
						//if(num < 10)
						//System.out.println("rec: " + a + " and " + b);
						num++;
					}
			}
		}
		ts = System.currentTimeMillis() - ts;
		//System.out.println("time: " + ts);
		return num;
	}

	private static boolean isrec(int a, int b) {
		int hi = a;
		int lo = 0;
		int[] base = {
				1,
				10,
				100,
				1000,
				10000,
				100000,
				1000000,
				10000000,
				100000000,
				1000000000};
		int i = 0;
		int len = 0;
		while(base[len] < a) len++;
		if(b >= base[len] || b <= base[len]/10) return false;
		while (hi > 0){
			int num = lo*base[len-i]+hi;
			
			if(num == b) {
				//System.out.println(a + " " + b + ": " + hi + "|" + lo);
				return true;
			}
			hi /=  10;
			lo = a - hi*base[i+1];
			i++;
		}
		return false;
	}
}
