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.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;


public class A {
	
	static int findRecycledNumbers(int a, int b) {
		int count = 0;
		boolean[] arr = new boolean[b+1];
		
		for (int i = a; i <= b; i++) {
			String num = Integer.toString(i);
			for (int k = 0; k < arr.length; k++) arr[k] = false;
			for (int j = 1; j < num.length(); j++) {
				String dNum = num.substring(j) + num.substring(0, j);
				int x = Integer.parseInt(dNum);
				if (x >= a && x <= b && !arr[x]) arr[x] = true;
				else continue;
				if (x >= a && x <= b && i < x) {
					System.out.println(a + " - " + b + ": " + i + " " + x);
					count++;
				}
			}
		}
		
		return count;
	}
	
	public static void main(String args[]) throws IOException {		
		Scanner sc = new Scanner(new File("input"));
		FileWriter fstream = new FileWriter("output");
		BufferedWriter out = new BufferedWriter(fstream);
	
		
		int n = sc.nextInt();
		for (int i = 0; i < n; i++) {
			int a = sc.nextInt();
			int b = sc.nextInt();
			out.write("Case #" + (i+1) + ": " + findRecycledNumbers(a, b) + "\n");
		}
		
		out.close();
	}
}
