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.File;
import java.io.IOException;
import java.io.PrintStream;
import java.util.ArrayList;
import java.util.Collections;
import java.util.LinkedList;
import java.util.Scanner;

public class Recycled {

	public static void main(String[] args) throws IOException{
		Scanner sc = new Scanner(new File("recycled.in"));
		System.setOut(new PrintStream(new File("recycled.out")));
		int T = sc.nextInt();
		LinkedList<Pair> p;
		Pair add = null;
		for(int set=1; set<=T; set++){
			p = new LinkedList<Pair>();
			int A = sc.nextInt();
			int B = sc.nextInt();
			for(int n=A; n<B+1; n++){
				String sA = n+"";
				for(int j = 1; j<sA.length(); j++){
					String sM = sA.substring(j)+sA.substring(0,j);
					int m = Integer.parseInt(sM);
					add = new Pair(n,m);
					if(A<= m && m<=B && n!=m && !p.contains(add)){
						p.add(add);
					}
				}
			}
			System.out.println("Case #"+set+": "+p.size());
		}
	}

}
class Pair{
	int small, large;
	public Pair(int i, int j){
		if(i<j){
			small = i; large = j;
		}
		else{
			small = j; large = i;
		}
	}
	public boolean equals(Object o){
		return ((Pair)o).small == small && ((Pair)o).large == large;
	}
}
