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.*;
import java.util.*;

public class c {

	public static void main(String[] args) {

		Scanner stdin = new Scanner(System.in);

		int[][] list = new int[1000][2];
		for (int i=0; i<1000; i++)
			for (int j=0; j<2; j++)
				list[i][j] = -1;

		for (int i=10; i<1000; i++) {
			fill(i,list[i]);
		}

		int numCases = stdin.nextInt();

		for (int loop=1; loop<=numCases; loop++) {

			int A = stdin.nextInt();
			int B = stdin.nextInt();

			int sum = 0;
			for (int i=A; i<=B; i++) {
				for (int j=0; j<2; j++)
					if (list[i][j] != -1 && list[i][j] <= B)
						sum++;
			}
			System.out.println("Case #"+loop+": "+sum);
		}
	}

	public static void fill(int val, int[] array) {

		if (val < 100) {

			int other = (val%10)*10 + val/10;
			if (other > val)
				array[0] = other;
		}
		else {
			int orig = val;
			int index = 0;
			for (int i=0; i<2; i++) {
				val = (val%10)*100 + val/10;
				if (val > orig) {
					array[index] = val;
					index++;
				}

			}
		}
	}
}