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

public class C {

	private void work() throws IOException {

		Scanner sc = new Scanner(new FileReader("C-large.in"));
		PrintWriter pw = new PrintWriter(new FileWriter("C-large.out"));
		Set<Integer> set = new HashSet<Integer>();
		int nc = sc.nextInt();
		for (int tc = 1; tc <= nc; tc++) {
			int a = sc.nextInt();
			int b = sc.nextInt();
			int len = Integer.toString(a).length();
			char[] c = new char[len];
			int res = 0;
			for (int i = a; i <= b; i++) {
				set.clear();
				int t = i;
				for (int j = len - 1; j >= 0; j--) {
					c[j] = (char) (t % 10 + '0');
					t /= 10;
				}
				for (int j = 0; j < len - 1; j++) {
					char tmp = c[len - 1];
					for (int k = len - 1; k > 0; k--) {
						c[k] = c[k - 1];
					}
					c[0] = tmp;
					int blah = Integer.valueOf(new String(c));
					if (blah > i && blah <= b)
						set.add(blah);
				}
				res += set.size();
			}
			pw.printf("Case #%d: %d\n", tc, res);
		}
		pw.close();
	}

	public static void main(String[] args) throws IOException {
		new C().work();
	}

}
