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.*;

public class Test3 {

	final static String INPUT_FILE_NAME = "input3";

	int T = 0;
	int q = 0;

	public static void main(String args[]) {
		try {
			Test3 tst = new Test3();
			tst.getInput();
		}
		catch (Exception e) {
			e.printStackTrace();
		}
	}

	private void getInput() throws Exception {
		File file = new File(INPUT_FILE_NAME);
		FileReader fis = new FileReader(file);
		BufferedReader br = new BufferedReader(fis);
		String strT = br.readLine();
		T = getInt(strT);

		for (int i=0; i<T; i++) {
			String strHead = br.readLine();
			String[] AandB = strHead.split(" ");
			int A = getInt(AandB[0]);
			int B = getInt(AandB[1]);

			//list kakunou
			execuse(i, A, B);
		}
	}

	private void execuse(int t, int A, int B) {
		int rtn = 0;
		int[] counts = new int[B+1];
		for (int i=0; i<=B;i++) {
			counts[i] = 0;
		}

		for (int i=A; i<=B;i++) {
			if (sortNumber(i)>0) {
				counts[sortNumber(i)]++;
			}
		}

		for (int i=0; i<=B;i++) {
//System.out.println("i="+i+" counts="+counts[i]);
			rtn += counts[i] * (counts[i]-1) / 2;
		}

		System.out.println("Case #"+(t+1)+": "+rtn);
		//System.out.println("Hello WorldI");
	}

	private int sortNumber(int i) {
		String str = String.valueOf(i);
		int keta = str.length();

		int min = i;
		String slideStr = str;
		for (int k=0; k<keta; k++) {
			slideStr = slideStr.substring(1)+slideStr.substring(0,1);
			if (min > getInt(slideStr)) {
				min = getInt(slideStr);
			}
		}

		return min;
	}

	private int getInt(String a) {
		return Integer.parseInt(a, 10);
	}

	private int getIntx(String a) {
		if (a.equals(".")) {
			return 0;
		}
		return 1;
	}

}
