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.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.HashMap;


public class RecycledNumbers {
	public static void main(String[] args) {
		try {
			FileWriter w = new FileWriter(new File("E:\\output.out"));
			BufferedReader r = new BufferedReader(new FileReader(new File("E:\\C-small-attempt0.in")));
			int numbeOfCases = Integer.parseInt(r.readLine());
			for(int t = 0; t < numbeOfCases; t++) {
				String[] nums = r.readLine().split(" ");
				int b = Integer.parseInt(nums[1]);
				int a = Integer.parseInt(nums[0]);
				int number = 0;
				HashMap<String, String> f = new HashMap<String, String>();
				for(int n = a, digits = nums[0].length(), max = (int) (Math.pow(10, digits) - 1); n < max; n++)
					for(int j = 1; j < digits; j++)
						if(n % Math.pow(10, j) >= Math.pow(10, j - 1)) {
							int m = (int) ((n % Math.pow(10, j)) * (Math.pow(10, digits - j)) + n / Math.pow(10, j));
							if(m > n  && m <= b && !f.containsKey(m + "," + n) && !f.containsKey(n + "," + m)) {
								number++;
								f.put(m + "," + n,"");
								f.put(n + "," + m,"");
							}
						}
				w.write("Case #" + (t + 1) + ": " + number);
				if(t < numbeOfCases - 1)
					w.write("\n");
			}
			w.close();
			r.close();
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		} catch (IOException e) {
			e.printStackTrace();
		}
	}
}