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.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;


public class QRProblemC {
	public static void main(String[] args) {
		try {
			char problem = 'C';
			int attempt = 1;
			BufferedReader input = new BufferedReader(new FileReader(problem + "-small-attempt" + attempt + ".in"));
			BufferedWriter output = new BufferedWriter(new FileWriter(problem + "-small-attempt" + attempt + ".out"));
			int lines = Integer.parseInt(input.readLine());
			for (int i = 0; i < lines; i++) {
				String in = input.readLine();
				System.out.println(in);
				String out = "";
				//Code here
				String[] numbers = in.split(" ");
				int A = Integer.parseInt(numbers[0]);
				int B = Integer.parseInt(numbers[1]);
				int count = 0;
				for (int n = A; n < B; n++) {
					for (int m = n + 1; m <= B; m++) {
						String goal = Integer.toString(m);
						String start = Integer.toString(n);
						while (start.length() < goal.length()) start = "0" + start;
						for (int j = 1; j < start.length(); j++) {
							if (start.charAt(j) == goal.charAt(0)) {
								if (goal.equals(start.substring(j) + start.substring(0, j))) {
									count++;
									break;
								}
							}
						}
					}
				}
				out = Integer.toString(count);
				//End code
				out = "Case #" + (i + 1) + ": " + out.trim();
				System.out.println(out);
				output.append(out);
				if (i < lines - 1) output.append("\n");
			}
			input.close();
			output.close();
		}
		catch (Exception e) {
			System.err.println(e.getMessage());
			e.printStackTrace();
		}
	}
}
