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

/**
 *
 * @author posv
 */

public class Recycle{
	public static void main(String[] args){
		int cs = 0;
		int a,b,n,m;
		int temp1, temp2,total,len;
		double temp;
		total = 0;
		try{
			File file = new File("lines2.txt");
			BufferedReader reader = new BufferedReader(new FileReader(file));
			String line = null;
			while ((line = reader.readLine()) != null){
				String[] tokens = line.split(" ");
				Set<Double> ints = new HashSet<Double>();
				if(cs==0){
					cs++;
					continue;
				} else {
					a = Integer.parseInt(tokens[0]);
					b = Integer.parseInt(tokens[1]);
					len = tokens[0].length();
					if(len == 1){
						System.out.println("Case #" +cs+": " + 0);
					}else{
						for(int i=a;i<=b;i++){
							int k = len;
							int j=10;
							temp1 = i;
							while(j<=(Math.pow(10,len-1))){
								temp2 = (int)(temp1%(j)*(Math.pow(10,k-1))) + (int)(temp1/j);
								if(temp1>= i && temp1 <= b && temp2<=b && temp1 < temp2){
									total++;
									temp = temp1*(Math.pow(10,len)) + temp2;
									ints.add(temp);
								}
								k--;
								j=j*10;
							}
						}
					System.out.println("Case #" +cs+": " + ints.size());
					}
				}
				cs++;
			}
		} catch(Exception ex){
			ex.printStackTrace();
		}
	}
}
