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.PrintStream;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class Recycled {
	public void calc() {
		Scanner in = null;
		PrintStream out = null;
		try {
			// in = new Scanner(new File("./A-small-attempt3.in"));
			in = new Scanner(System.in);
			out = new PrintStream(new File("./out.txt"));
		} catch (Exception e) {
			System.err.println(e);
			System.exit(-1);
		}

		int lines = in.nextInt();
		in.nextLine();
		for (int i = 0; i < lines; i++) {
			out.print("Case #");
			out.print(i + 1);
			out.print(": ");
			int b = in.nextInt();
			int e = in.nextInt();
			in.nextLine();
			int count = 0;
			Set<String> set = new HashSet<String>();
			for (int j = b; j < e; j++) {
				set.clear();
				String s = Integer.toString(j);
				for (int c = 1; c < s.length(); c++) {
					String d = s.substring(c).concat(s.substring(0, c));
					int di = Integer.parseInt(d, 10);
					if (di > j && di <= e) {
						if (!set.contains(d)) {
							set.add(d);
							count++;
						}
					}
				}
			}
			out.print(count);
			out.print('\n');
		}
		out.flush();
		out.close();
		in.close();
	}

	public static void main(String[] args) {
		Recycled g = new Recycled();
		g.calc();
	}

}
