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.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Date;


public class CSol {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		
		Date d1 = new Date();
		//solveC("c.in", "c.out");
		//solveC("C-small-attempt0.in", "C-small-attempt0.out");
		solveC("C-large.in", "C-large.out");
		Date d2 = new Date();
		System.out.println("time: " + (d2.getTime() - d1.getTime()) + " ms");

	}

	private static void solveC(String in, String out) {
		try {
			FileReader fis = new FileReader(in);
			BufferedReader  dis = new BufferedReader (fis);
			
			FileWriter fw = new FileWriter(out);
			BufferedWriter bw = new BufferedWriter(fw);

			
			int t = Integer.parseInt(dis.readLine());
			for (int i = 0; i < t; i++) {
				String e = dis.readLine();
				String ee[] = e.split(" ");
				int a = Integer.parseInt(ee[0]);
				int b = Integer.parseInt(ee[1]);
				//System.out.println(a +  " " + b);
				
				
				String result = ""+solve(a,b);
				//System.out.println(result);
				
				bw.write("Case #" + (i+1) + ": " + result + "\n");
			}
			
			
			bw.flush();
			bw.close();
			fw.close();
			dis.close();
			fis.close();
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		} catch (IOException e) {
			e.printStackTrace();
		} finally {
			
		}
	}

	private static long solve(int a, int b) {
		long sum = 0;
		//System.out.println("solve: " + a+ " " + b);
		ArrayList<String> uniq = new ArrayList<String>();
		
		
		for (int ii = a; ii <= b; ii++) {
			//System.out.println(ii);

			String s = "" +ii;
			String rot = "" + s+s;
			
			
			
			for (int i = 1; i < s.length(); i++) {
				String r = rot.substring(i, i+s.length());
				if (r.charAt(0) == '0') 
					continue;
								
				if (s.compareTo(r) < 0) {
					if (r.compareTo(""+b) <= 0) {
						if (r.compareTo(""+a) >= 0) {
							if (!uniq.contains(s+r)) {
								uniq.add(s+r);
								//System.out.println(s + " " + r);
								sum++;
							}
						}
					}
				}
			}
			
		}
		
		return sum;
	}

}
