import java.io.FileInputStream;
import java.util.HashMap;
import java.util.Scanner;
import java.util.TreeSet;

// Recycled Numbers
// https://code.google.com/codejam/contest/1460488/dashboard#s=p2

public class C {

	private static String process(Scanner in) {
		int A = in.nextInt();
		int B = in.nextInt();
		int res = 0;
		int len = Integer.toString(A).length();
		for(int n = A; n < B; n++) {
			String str = Integer.toString(n);
			TreeSet<Integer> set = new TreeSet<Integer>();
			for(int i = 1; i < len; i++) {
				int m = Integer.parseInt(str.substring(i, len) + str.substring(0, i));
				if ( m > n && m <= B && ! set.contains(m) ) {
					set.add(m);
					res++;
				}
			}
		}
		return Integer.toString(res);
	}

	public static void main(String[] args) throws Exception {
		Scanner in = new Scanner(System.in.available() > 0 ? System.in : 
			new FileInputStream(Thread.currentThread().getStackTrace()[1].getClassName() + ".practice.in"));
		int T = in.nextInt();
		for(int i = 1; i <= T; i++) 
			System.out.format("Case #%d: %s\n", i, process(in));
	}
}

import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Scanner;

public class C {
	public static void main(String[] args) throws IOException {
		String filename = "C-small-attempt0";
		String inname = filename + ".in";
		String outname = filename + ".out";
		Scanner sc = new Scanner(new File(inname));
		//Scanner sc = new Scanner(System.in);
		PrintWriter out = new PrintWriter(new FileWriter(outname));

		int N = sc.nextInt();
		for (int t = 1; t <= N; t++) {
			int a = sc.nextInt();
			int b = sc.nextInt();
			int l = Integer.toString(a).length();
			int ans = 0;
			for(int n = a; n <= b; n++) {
				for(int i = 1; i < l; i++) {
					int front = n/((int)Math.pow(10, i));
					int back = n%((int)Math.pow(10, i));
					int m = back * (int) Math.pow(10,l-i) + front;
					//System.out.println(m + " " + n);
					if(m != n && m/(int)Math.pow(10,l-1) != 0 && n < m && m <= b) ans++;
				}
				
			}
			out.println("Case #" + t + ": " + ans);
			System.out.println("Case #" + t + ": " + ans);
		}
		out.close();
	}
}
