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


public class RecycledNumbers {
	
	public static void main(String[] args) throws Exception {
		int i,j,k;
		int A, B;
		int L;
		String first, second, secondNoLeadingZeros;
		int s;
		HashSet<Integer> hs = new HashSet<Integer>();
		
		BufferedReader br = new BufferedReader(new FileReader("C-large.in"));
		PrintWriter out = new PrintWriter("C-large.out");
		StringTokenizer st;
		
		int T = Integer.parseInt(br.readLine());
		int res;
		
		for (k=1;k<=T;k++) {
			System.out.println(k+"/"+T);
			st = new StringTokenizer(br.readLine());
			A = Integer.parseInt(st.nextToken());
			B = Integer.parseInt(st.nextToken());
			L = Integer.toString(A).length();
			res = 0;
			
			for (i=A;i<=B;i++) {
				
				first = Integer.toString(i);
				hs.clear();
				hs.add(i);
				
				for (j=1;j<L;j++) {
					second = first.substring(j)+first.substring(0, j);
					s = Integer.parseInt(second);
					secondNoLeadingZeros = Integer.toString(s);
					if (secondNoLeadingZeros.length() == L) {
						if (( s >= A)&&(s <= B)) {
							if (hs.contains(s) == false) {
								hs.add(s);
								res++;
							}
						}
					}
				}
					
			}
			
			res /= 2;
			out.println("Case #"+k+": "+res);
			
		}
		
		out.close();
		
	}

}
