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.util.*;
import java.io.*;

public class recycle {
	public static String cycle(String n){
		String[] t = new String[n.length()];
		for(int i = 0; i < n.length(); i++){
			t[i] = n.substring(i, i+1);
		}
		
		String q = t[n.length() - 1];
		for(int i = n.length() - 2; i >= 0; i--){
			t[i+1] = t[i];
		}
		t[0] = q;
		
		String res = "";
		for(int i = 0; i < n.length(); i++){
			res += t[i];
		}
		return res;
	}
	public static boolean cycletest(String n, String m){
		boolean con = false;
		for(int i = 0; i < m.length(); i++){
			m = cycle(m);
			if(n.equals(m)){
				con = true;
			} 
		}
		return con;
	}
	public static void main(String[] args) throws IOException{
		Scanner reader = new Scanner(new File("recycle.in"));
		PrintWriter out = new PrintWriter(new File("recycle.out"));
		
		int n = reader.nextInt();
		int[][] set = new int[n][2];
		
		for(int i = 0; i < n; i++){
			set[i][0] = reader.nextInt();
			set[i][1] = reader.nextInt();
		}
		
		int counter = 0;
		int[] res = new int[n];
		for(int i = 0; i < n; i++){
			for(int j = set[i][0]; j <= set[i][1]; j++){
				for(int q = j+1; q <= set[i][1]; q++){
					if(cycletest(Integer.toString(q), Integer.toString(j))){
						counter++;
					}
				}
			}
			res[i] = counter;
			counter = 0;
		}
		
		for(int i = 0; i < n; i++){
			out.println("Case #" + (i+1) + ": " + res[i]);
		}
		
		out.close();
		System.exit(0);
	}
}
