import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;

public class CopyOfCopyOfMain {

	static int ndigits(int n) {
		return (int) (Math.log10(n) + 1);
	}

	static int rot(int n, int dig) {
		return (int) ((n % 10) * Math.pow(10, dig - 1)) + (int) (n / 10);
	}

	public static void main(String[] args) throws FileNotFoundException {
		String file = "C-large";
		Scanner in = new Scanner(new File(file + ".in"));
		PrintWriter out = new PrintWriter(new File(file + ".out"));

		int T = in.nextInt();
		for (int t = 1; t <= T; t++) {
			int A = in.nextInt();
			int B = in.nextInt();

			int c = 0;
			int[] list = new int[ndigits(B)];
			numbers: for (int i = A; i <= B; i++) {
				int digs = ndigits(i);
				int rot = i;
				int pairs = 0;

				Arrays.fill(list, -1);
				list[0] = i;

				digits: for (int j = 1; j <= digs + 1; j++) {

					rot = rot(rot, digs);
					if(rot < i)
						continue;

					if (A <= rot && rot <= B) {
						for (int k = 0; k < j; k++) {
							if (list[k] == rot) {
								continue digits;
							}
						}
						pairs++;
						list[j] = rot;
					}
				}

				//c += pairs * (pairs + 1) / 2;
				c += pairs ;
				// c+=digs;
			}
			out.println("Case #" + t + ": " + c);
		}

		in.close();
		out.close();
	}
}

import java.util.HashSet;
import java.util.Scanner;


public class Main {
	public static void main(String [] args) {
		Scanner in = new Scanner(System.in);
		int T = in.nextInt();
		for(int x=0; x<T; x++) {
			int A = in.nextInt();
			int B = in.nextInt();
			int pow = (int) Math.floor(Math.log10(A));
			//System.out.println("Pow=" + String.valueOf(pow));
			int tomult = (int) Math.pow(10, pow);
			int compteur = 0;
			for(int n=A; n<=B; n++) {
				HashSet<Integer> founds = new HashSet<Integer>();
				int m = n;
				for(int i=0; i<pow; i++) {
					m = (m%10)*tomult + m/10;
					//System.out.println("m="+ String.valueOf(m));
					if(m>n && m<= B && ! (founds.contains(m))) {
						compteur++;
						founds.add(m);
						//System.out.println("("+String.valueOf(n)+","+String.valueOf(m)+")");
					}
				}
			}
			System.out.print("Case #" + String.valueOf(x+1) + ": ");
			System.out.println(compteur);
		}
	}
}