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.util.Scanner;


public class ProblemC {

	public static int rotate(int x) {
		int y = x % 10;
		x /= 10;
		int cd = (x + "").length();
		if (x == 0) {
			cd = 0;
		}
		y *= Math.pow(10, cd);
		y += x;
		return y;
	}
	
	public static String rotate(String x) {
		String r = x.substring(0, 1);
		if (x.length() > 1) {
			r = x.substring(1) + r;
		}
		return r;
	}
	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int t = sc.nextInt();
		for (int tt = 1; tt <= t; tt++) {
			int a = sc.nextInt();
			int b = sc.nextInt();
			int c = 0;
			for (int i = a; i <= b; i++) {
				String s = i + "";
				while (true) {
					s = rotate(s);
					int x = Integer.parseInt(s);
					if (x == i) {
						break;
					}
					if (x > i && x >= a && x <= b) {
//						System.out.println(i + " " + x);
						c++;
					}
				}
			}
			System.out.println("Case #" + tt + ": " + c);
		}
	}

}
