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.*;
public class codejam {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc=new Scanner(System.in);
		int m=sc.nextInt();
		int i;
		int j;
		int k;
		int x;
		int y;
		int l;
		int z;
		for(i=1;i<=m;i++) {
			int a=sc.nextInt();
			int b=sc.nextInt();
			int count=0;
			
			for(j=a;j<=b;j++) {
				x=j;
				l=Integer.toString(j).length();
				int[] used=new int[l];
				for(k=1;k<=l-1;k++) {
					// shift k digits
					
					y=(int)Math.pow(10, k)*(x%(int)Math.pow(10, l-k))+x/(int)Math.pow(10,l-k);
					y=y+2-2;
					if(x<y && y<=b) {
					
						boolean neu=true;
						for(z=0;z<l;z++) {
							if(used[z]==y) {
								neu=false;
								break;
							}
						}
					
						if(neu) {
							count++;
							used[k]=y;
//							System.out.println(x+" "+y);
						}
					}
				}
			}
			System.out.println("Case #"+i+": "+count);
		}
	}

}
