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.io.FileReader;
import java.io.BufferedReader;
import java.io.IOException;
import java.util.Scanner;
import java.util.Locale;

public class NumberPairs {
	public static void main(String[] args) throws IOException {
		Scanner s = null;

		try {
			s = new Scanner(new BufferedReader(new FileReader("NumberPairs.in")));

			int N = s.nextInt();

			for (int i = 1; i <= N; i++) {
				int a = s.nextInt(), b = s.nextInt();
				System.out.println("Case #" + i + ": " + calculate(a, b));
			}
		} finally {
			if (s != null) {
				s.close();
			}
		}
	}

	static int calculate(int a, int b) {
		int result = 0;
		for (int i = a; i <= b; i++)
			for (int j = i; j <= b; j++)
				if (isPair(i,j)) result++;

		return result;
	}

	static boolean isPair(int x, int y) {
		if (x == y) return false;

		byte[] p1 = ("" + x).getBytes(), p2 = ("" + y).getBytes();
		int size = p1.length;
		
		for (int start = 0; start < size; start++) {
			for (int offset = 0; offset < size; offset++) {
				if (p1[offset] != p2[(start + offset) % size])
					break;

				if (offset == size - 1) {
					// System.out.println("Pair: " + x + " " + y);
					return true;
				}
			}
		}	

		return false;
	}
}
