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 cg.y2012.Q3;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.HashSet;
import java.util.Set;

public class Q3 {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		
		 BufferedWriter out = null;
		try {
			String newLine = System.getProperty("line.separator");
		    out = new BufferedWriter(new FileWriter(args[0]+".output"));
		    BufferedReader b = new BufferedReader(new FileReader(args[0]));
		    int number_of_test_cases = Integer.parseInt(b.readLine().split(" ")[0]);
		    for( int tc = 0; tc < number_of_test_cases; tc++) {
		    	int[] data = convertToInt(b.readLine());
		    	int A = data[0];
		    	int B = data[1];
		    	Set<String> s = new HashSet<String>();
				int count = 0;
				for (int n = A; n <= B; n++) {
					for (int m : getRecycled(n)) {
						if(m> n  && m <= B){
							count++;
//							if(tc < number_of_test_cases-1)
//								if(!s.add("(" + n + "," + m + ")"))
//									System.out.println("(" + n + "," + m + ")");
						}
					}
				}
			    out.write("Case #"+(tc+1)+": "+count+newLine);
			}
		} catch (IOException e) {
			System.out.println("Exception : "+e);
		}
		finally {
			if(out != null){
				try {
					out.close();
				} catch (IOException e) {
					e.printStackTrace();
				}
			}
		}
	}
	
	private static Set<Integer> getRecycled(int A){
		String a = Integer.toString(A);
		Set<Integer> r = new HashSet<Integer>();
		String temp="";
		for(int i =a.length();i>0;i--){
			temp = a.charAt(i-1)+temp;
			String x = temp+a.substring(0, i-1);
			r.add(Integer.parseInt(x));
		}
		return r;
	}
	
	private static boolean isRecycled(int A, int B){
		String a = Integer.toString(A);
		String b = Integer.toString(B);
		String temp="";
		for(int i =a.length();i>0;i--){
			temp = a.charAt(i-1)+temp;
			String x = temp+a.substring(0, i-1);
			if(x.equals(b)){
				return true;
			}
		}
		return false;
	}
	
	private static int[] convertToInt(String line){
		String data[] = line.split(" ");
		int[] rtn = new int[data.length];
		for(int i=0;i< data.length ;i++){
			rtn[i]=Integer.parseInt(data[i].trim());
		}
		return rtn;
	}
	
}