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.FileReader;
import java.io.BufferedReader;
import java.io.IOException;
import java.util.Scanner;
import java.util.Locale;

public class NumberPairs {
	public static void main(String[] args) throws IOException {
		Scanner s = null;

		try {
			s = new Scanner(new BufferedReader(new FileReader("NumberPairs.in")));

			int N = s.nextInt();

			for (int i = 1; i <= N; i++) {
				int a = s.nextInt(), b = s.nextInt();
				System.out.println("Case #" + i + ": " + calculate(a, b));
			}
		} finally {
			if (s != null) {
				s.close();
			}
		}
	}

	static int calculate(int a, int b) {
		int result = 0;
		for (int i = a; i <= b; i++)
			for (int j = i; j <= b; j++)
				if (isPair(i,j)) result++;

		return result;
	}

	static boolean isPair(int x, int y) {
		if (x == y) return false;

		byte[] p1 = ("" + x).getBytes(), p2 = ("" + y).getBytes();
		int size = p1.length;
		
		for (int start = 0; start < size; start++) {
			for (int offset = 0; offset < size; offset++) {
				if (p1[offset] != p2[(start + offset) % size])
					break;

				if (offset == size - 1) {
					// System.out.println("Pair: " + x + " " + y);
					return true;
				}
			}
		}	

		return false;
	}
}
