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 year2012.RecycledNumbers;

import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

final class RecycledNumbers {

	/**
	 * @param args
	 * @throws IOException
	 */
	static int solve(int upper, int value)
	{
		if (value < 12) return 0;
		String strNum = value + "";
	
		int length = strNum.length();
					
		Set<Integer> setNewNumber = new HashSet<Integer> ();	               	        
		for (int i = 1; i < length; i++) 
		{
		
				if (strNum.charAt(i) != '0')
				{	
					String first = strNum.substring(0, i);
					String last = strNum.substring(i, length);
					
					int newNum = Integer.parseInt(last + first);
					if (newNum <= upper && newNum > value ) setNewNumber.add(new Integer(newNum)) ;
				}
		
		}
		return setNewNumber.size();
	}
	
	public static void main(String[] args) throws IOException {

		String file = "C-large";
		Scanner sc = new Scanner(new FileReader(file + ".in"));
		PrintWriter pw = new PrintWriter(new FileWriter(file + ".out"));
				
		
		int T = sc.nextInt();
		int A = 0;
		int B = 0;
		sc.nextLine();
		for (int i = 0; i < T; i++) {
			A = sc.nextInt();
			B = sc.nextInt();
			int result = 0;
			for (int ii = A; ii <= B; ii++)
			{
				result += solve(B, ii);
			}			
			pw.println("Case #" + (i + 1) + ": " + result);

		}
		pw.flush();
		pw.close();
		sc.close();
	}
}
