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

class gcj2{
	public static void main(String[] args) throws IOException{
		BufferedReader inp = new BufferedReader(new FileReader("inp.txt"));
		BufferedWriter out = new BufferedWriter(new FileWriter("out.txt"));
		int test = Integer.parseInt(inp.readLine());
		int p = 1;
		while(test>0){
			String d[] = inp.readLine().split(" ");
			int a = Integer.parseInt(d[0]);
			int b = Integer.parseInt(d[1]);
			int i = a;
			int count = 0;
			while(i<=b){
				String s = new Integer(i).toString();
				int j = 1;
				HashSet<Integer> se = new HashSet<Integer>();
				while(j<s.length()){
					String temp = s.substring(j,s.length())+s.substring(0,j);
					if(temp.charAt(0)=='0') {
						j++;
						continue;
					}
					else {
						int t = Integer.parseInt(temp);
						se.add(t);
					}
					j++;
				}
				Iterator<Integer> it = se.iterator();
				while(it.hasNext()){
					int gg = it.next();
					if(gg>i&&gg<=b){
				//		System.out.println(gg +" "+i);
						count++;
					}
				}
			//	System.out.println("------------------");
				i++;
			}
			out.write("Case #"+p+": "+count+"\n");
			System.out.println(count);
			test--;
			p++;
		}
		out.close();
	}
}