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.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.util.ArrayList;

public class Pairs {

	public static void main(String[] args) throws Exception {

		BufferedReader fis = new BufferedReader(new FileReader(
				new File("input")));
		String numCasesStr = fis.readLine();
		int numCases = Integer.parseInt(numCasesStr);
		String val = "";
		int caseNum = 1;
		while ((val = fis.readLine()) != null) {
			String out = eval(val);
			System.out.println("Case #" + caseNum + ": " + out);
			caseNum++;
		}

	}

	private static String eval(String val) {
		String[] vals = val.split(" ");
		int a = Integer.parseInt(vals[0]);
		int b = Integer.parseInt(vals[1]);
		
		int out = 0;
		ArrayList<String> ss = new ArrayList<String>();
		
		if (b > 10 && a != b) {
			for(int i = a; i <= b; i++) {
				//Are there any rotations of i which is less than b
				String m = "" + i;
				for(int j = 0; j < m.length()-1; j++) {
					m = m.substring(1) + m.substring(0, 1);
					if(m.startsWith("0")) {
						continue;
					}
					int n = Integer.parseInt(m);
					if(n <= b && n > i) {
						String v = i  + " , " + m;
						if(!ss.contains(v)) {
							//Skip cases such as ???????1212 , 2121
							ss.add(v);
							out++;
						}
						
					}
				}
			}
		}
		
		return "" + out;
	}
	

}
