package codejam;

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

public class RecycledNumbers {
	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new FileReader("in.txt"));
		PrintWriter out = new PrintWriter(new File("out.txt"));
		
		int T = Integer.parseInt(in.readLine());
		for (int t = 1; t <= T; ++t) {
			String[] parts = in.readLine().split("[ ]+");
			int A = Integer.parseInt(parts[0]);
			int B = Integer.parseInt(parts[1]);
			
			int cnt = 0;
			for (int i = A; i < B; ++i) {
				String str = String.valueOf(i);
				int n = str.length();
				String res = "";
				Set<Integer> seen = new HashSet<Integer>();
				for (int j = n - 1; j > 0; --j) {
					res = str.substring(j) + str.substring(0, j);
					int k = Integer.parseInt(res);
					if (k > i && k <= B) {
						//System.out.println("(" + i + ", " + k + ")");
						if (!seen.contains(k)) {
							++cnt;
							seen.add(k);
						}
					}
				}
			}

			out.println("Case #" + t + ": " + cnt);
		}
		
		in.close();
		out.close();
		System.exit(0);
	}
}


/**
 *
 *
 * @Author      :Yasith Maduranga(Merlin)
 * @version     :1.0
 * @Date        :2012/4/14
 * @Copyright GSharp Lab, All Rights Reserved....
 */
import java.io.*;
import java.util.*;

class recyclednumbers {
	public static void main(String args[]){
		try{
	    	BufferedReader br = new BufferedReader(new FileReader("C-small-attempt0.in"));
	    	PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("C-small-attempt0.out")));

	    	int noOfCases = Integer.parseInt(br.readLine());

	    	for(int i=0;i<noOfCases;i++){
	    		String tmp[]=br.readLine().split(" ");
	    		long a=Long.parseLong(tmp[0]);
	    		long b=Long.parseLong(tmp[1]);
	    		long pairOfNo=0;
	    		ArrayList<Long> myArray=new ArrayList<Long>();
	    		myArray.add(a);

	    		for(long j=a;j<b+1;j++){
					long charLength=String.valueOf(j).length();
					if(charLength<=1){
						break;
					}
					for(long k=0;k<charLength-1;k++){
						String tmp1=String.valueOf(j).substring(0,(int)k+1);
						String tmp2=String.valueOf(j).substring((int)k+1);
						String newNo=tmp2+tmp1;
						if(Long.parseLong(newNo)<=b){
							if(!(Long.parseLong(newNo)==j)){
								if(!(Long.parseLong(newNo)<=j)){
									boolean isRepeated=true;
									for(long l=0;l<myArray.size();l++){
										if(myArray.get((int)l)==Long.parseLong(newNo)){
											isRepeated=true;
										}else{
											isRepeated=false;
										}
									}
									if(!isRepeated){
										pairOfNo++;
										myArray.add(Long.parseLong(newNo));
									}

								}
							}
						}
					}
	    		}
				out.println("Case #"+(i+1)+": "+pairOfNo);
	    	}



	    	out.close();
		}catch(Exception e){
			e.printStackTrace();
		}
	    	System.exit(0);
	}
}
