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);
	}
}

import java.util.ArrayList;
import java.util.Scanner;


public class DancingWithTheGooglers {
	public static void main(String[] args){		
		Scanner keyin=new Scanner(System.in);
		int T=keyin.nextInt();
		keyin.nextLine();
		int caseCount=0;
		while ((T--)!=0){
			int A=keyin.nextInt();
			int B=keyin.nextInt();
			int count=0;
			caseCount++;
			ArrayList<String> result=new ArrayList<String>();
			for (int n=A; n<=B; n++){
				for (int m=n+1; m<=B; m++){
					String strN=Integer.toString(n);
					String strM=Integer.toString(m);
					for (int i=1; i<strN.length(); i++){
						String temp="";
						temp=strN.substring(i)+""+strN.substring(0,i);
						if (strM.equals(temp) && Integer.parseInt(strN)<Integer.parseInt(strM)){
							boolean isDuplicate=false;
							if (result!=null){
								for (int arrayIndex=0; arrayIndex<result.size(); arrayIndex++){
									if (result.get(arrayIndex).equals("("+strN+", "+strM+")")){
										isDuplicate=true;
									}
								}
							}
							if (isDuplicate==false){
								//System.out.println("("+strN+", "+strM+")");
								result.add("("+strN+", "+strM+")");
								count++;
							}
						}
					}
				}
			}
			System.out.println("Case #"+caseCount+": "+count);
		}
	}
}
