import java.util.*;
import java.io.*;

public class recycled_numbers {
	public static void main(String[]a) throws Exception{
		
		Scanner f = new Scanner(new File(a[0]));
		int result=0;
		int A,B;
		String n,m;
		HashSet<String> s=new HashSet<String>();
		
		int T=f.nextInt();	//T total case count
		for (int t=1; t<=T;t++){//for each case t
			
			s.clear();
			result=0;				//reset
			A=f.nextInt();B=f.nextInt();	//get values for next case
			
			if (A==B)result=0;//remove case not meeting problem limits 
			else{
				for(int i=A;i<=B;i++){//for each int in range
					n=Integer.toString(i);
					m=new String(n);
					//System.out.println(n);
					for (int j=1;j<n.length();j++){//move each digit to the front & test
						m = m.substring(m.length()-1)+m.substring(0,m.length()-1);
						if(m.matches("^0+[\\d]+")!=true &&
								Integer.parseInt(m)<=B &&
								Integer.parseInt(n)<Integer.parseInt(m)){
							s.add(new String(n+","+m));
							//result++;
							//System.out.println(" matched: "+m);
						}
						
					}
				}
				result = s.size();
			}

			//display output
			System.out.println("Case #" + t + ": " + result);
		}
	}
}
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Scanner;


public class RecycledNumbers {

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

		Scanner sc = new Scanner(new FileReader("C-large.in"));
		PrintWriter pw = new PrintWriter(new FileWriter("outputC2.txt"));

		int caseCount = sc.nextInt();
		sc.nextLine();

		int a, b, count, c, k, l;
		for (int caseNum = 0; caseNum < caseCount; caseNum++) {

			a = sc.nextInt();
			b = sc.nextInt();

			count = 0;
			for (int i = a; i <= b; i++) {

				k = 10;
				l = (int) Math.pow(10, (int) Math.log10(i));
				HashSet<Integer> pairs = new HashSet<Integer>();
				while (k < i) {
					c = (i % k)*l + i/k;

					if (i < c && c <= b) {
						pairs.add(c);
					}

					k *= 10;
					l /= 10;
				}
				count += pairs.size();
			}

			pw.write("Case #" + (caseNum + 1) + ": ");
			pw.write(count + "\n");
		}

		pw.flush();
		pw.close();
		sc.close();
	}
}
