import java.util.HashSet;
import java.util.Scanner;

public class C {

	static HashSet p = new HashSet();
	static int low;
	static int high;
	int count = 0;

	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);
		int no = sc.nextInt();

		for (int i = 1; i <= no; i++) {

			p.clear();
			low = sc.nextInt();
			high = sc.nextInt();

			for (int l = low; l <= high; l++) {
				recycle(l);
			}
			System.out.println("Case #" + i + ": " + p.size());

		}
	}

	public static void recycle(int no) {

		String s = Integer.toString(no);
		for (int i = 0; i < s.length(); i++) {
			String rec = s.substring(i) + s.substring(0, i);
			int r = Integer.parseInt(rec);
			if (r != no && r >= low && r <= high) {
				int min = Math.min(r, no);
				int max = Math.max(r, no);
				String a = Integer.toString(min) + "" + Integer.toString(max);
				p.add(a);

			}
		}

	}
}

package CodeJam;

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

public class CC_2012 {

	public static void main(String[] args) throws IOException {
		Scanner in = new Scanner(System.in);
		PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("tt.out")));
		
		int c = in.nextInt();
		
		for(int cases=0;cases<c;cases++){
			int A = in.nextInt();
			int B = in.nextInt();
			int C = 0;
			
			for(int i=A;i<B;i++){
				int n = String.valueOf(i).length();
				String I = String.valueOf(i);
				for(int k=1;k<n;k++){
					int ip = Integer.parseInt(I.substring(n-k, n)+I.substring(0, n-k));
					if(i<ip && ip<=B) C++;					
				}	
			}
		
			out.println("Case #"+(cases+1)+": "+C);
		}
		out.close();
		System.exit(0);
	}
}
