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();
	}
}

package cl.rodrigo;

import java.io.BufferedReader;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.AbstractList;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
import java.lang.StringBuffer;

public class RecycledNumbers {

	/**
	 * @param args
	 * @throws IOException 
	 * @throws NumberFormatException 
	 */
	public static void main(String[] args) throws NumberFormatException, IOException {
		FileInputStream fstream;
		
		int count;
		try {
			fstream = new FileInputStream("/home/rodrigo/Descargas/C-large.in");
			DataInputStream in = new DataInputStream(fstream);
			BufferedReader br = new BufferedReader(new InputStreamReader(in));
			String strLine;
			
			count = Integer.parseInt(br.readLine());
			
			
			FileWriter outFile = new FileWriter("/home/rodrigo/GoogleCodeJam/C-small.out");
            PrintWriter out = new PrintWriter(outFile);
			
			for (int z=1;z<=count;z++) {
				HashMap hm = new HashMap();
				Integer contador = 0;
				String[] linea = br.readLine().split(" ");
				String lineakeypad = new String();
				
				Integer min = Integer.parseInt(linea[0]);
				Integer max = Integer.parseInt(linea[1]);
				
				//System.out.println(min+"-"+max);
				
				for(int i=min;i<=max;i++) {
					
					for(int j=1;j<= String.valueOf(max).length()-1;j++) {
						
						String num = new String();
						String num_pre = new String();
						String num_post = new String();
				        String num_final = new String();
				        Integer num_int ;
						num = String.valueOf(i);
						
						num_pre = num.substring(j);
						num_post = num.substring(0, j);
						
						
						
						
						
						num_final = num_pre + num_post; 
						num_int = Integer.parseInt(num_final);
						
						
						
						
						if (min <= i && i < num_int && num_int <= max && min <= num_int && i <= max) {
						//	System.out.println(num+"-"+num_int);
						
							
							hm.put(num+"-"+num_int, 1);
							
							
						}
							
						
					}
				}
					
				Iterator<?> it = hm.entrySet().iterator();
				while (it.hasNext()) {
					contador++;
					it.next();
				}
				
				out.print("Case #"+z+": ");
				out.print(contador);
				out.println("");
				
			}
			
			out.close();
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}

	}

}
