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.FileReader;
import java.io.FileWriter;
import java.io.PrintWriter;
import java.io.StreamTokenizer;
import java.util.HashSet;


public class Recycled {

	public static void main(String[] args) throws Exception {
		Recycled object = new Recycled();
		object.solve(object.getClass().getSimpleName().toLowerCase());
		}	
	
	public HashSet<Long> hash;
	public int powersOfTen[];

		private void solve(String filePrefix) throws Exception {
			
			StreamTokenizer st = new StreamTokenizer(new BufferedReader(new FileReader(filePrefix + ".in")));
			PrintWriter pw = new PrintWriter(new FileWriter(filePrefix + ".out"));
			
			st.nextToken();
			int testsCount = (int) st.nval;			
			
			for (int tc=0; tc<testsCount; tc++)
			{
				st.nextToken();
				int a = (int) st.nval;
				
				st.nextToken();
				int b = (int) st.nval;
				
				int digits = 0;
				int temp = a;
				
				while (temp > 0)
				{
					temp /= 10;
					digits++;
				}
				
				powersOfTen = new int[digits];
				powersOfTen[0] = 1;
				
				for (int i=1; i<powersOfTen.length; i++)
					powersOfTen[i] = powersOfTen[i-1]*10;
				
				hash = new HashSet<Long>();
				
				for (int n=a; n<b; n++)
				{
					generate(a, b, n, digits);					
				}								
														
				pw.write("Case #" + (tc+1) + ": " + hash.size() + "\n");
			}
			
			pw.flush();
			pw.close();			
		}

		private void generate(int a, int b, int n, int digits) {
			
			for (int take=1; take<digits; take++)
			{
				int first = n / powersOfTen[take];
				int last = n % powersOfTen[take];
				
				int m = last * powersOfTen[digits-take] + first;
				
				if (m <= n)
					continue;
				
				if (m < a || m > b)
					continue;
				
				long encoded = (n+0L) << 30L;
				encoded += m;
				
				if (encoded < 0)
					throw new RuntimeException();
				
				hash.add(encoded);
			}			
		}
}
