
import java.util.Scanner;
import java.util.Set;
import java.util.TreeSet;
import java.io.File;
import java.io.IOException;
import java.io.FileWriter;
import java.io.BufferedWriter;

public class Recycle
{
	public static void main(String[] args)
	{
/*		Set<Integer> perms = getPermutations(123456);
		
		for(Integer i: perms)
			System.out.println(i);*/
	
		try
		{
			Scanner s = new Scanner(new File("recycle.in"));
			BufferedWriter w = new BufferedWriter(new FileWriter(new File("recycle.out")));
			int numCases = s.nextInt();
			s.nextLine();
			
			for(int n = 1;n <= numCases; n++)
			{
				int A = s.nextInt();
				int B = s.nextInt();
				int count = 0;
				for(int k = A; k <= B; k++)
				{
					count += getNumPairs(k, B);
				}
				
				w.write("Case #" + n + ": " + count + "\n");
			}
			
			w.flush();
			w.close();
		}
		catch (IOException e)
		{
			e.printStackTrace();
		}
	}
	
	public static int getNumPairs(int n, int B)
	{
		Set<Integer> possibles = getPermutations(n);
		int count = 0;
		for(Integer i : possibles)
			if(i > n && i <= B)
				count++;
		return count;
	}
	
	public static Set<Integer> getPermutations(int n)
	{
		Set<Integer> perms = new TreeSet<Integer>();
		char[] digits = String.valueOf(n).toCharArray();
		
		for(int firstPos = 1; firstPos < digits.length; firstPos++)
		{
			String toBuild = "";
			for(int k = 0; k < digits.length; k++)
				toBuild += digits[(firstPos + k) % digits.length];
			perms.add(Integer.parseInt(toBuild));
		}
		return perms;
	}
	

}
package in.co.google.jam;

import java.io.BufferedReader;
import java.io.FileInputStream;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.List;

public class Recycled {

	public Recycled() throws Exception {
		BufferedReader br = new BufferedReader(new InputStreamReader(
				new FileInputStream("C:/C-small.in.txt")));
		int numTests = Integer.parseInt(br.readLine());
		for (int i = 0; i < numTests; i++) {
			int result = 0;
			String s = br.readLine();
			String[] numbers = s.split(" ");
			int A = Integer.parseInt(numbers[0]);
			int B = Integer.parseInt(numbers[1]);
			if (A < 10 && B < 10) {
				result = 0;
			} else {
				List<Integer> allNumbers = new ArrayList<Integer>();
				for (int x = A; x <= B; x++) {
					allNumbers.add(x);
				}
				int middle = allNumbers.size() / 2;
				int base = 0;
				int t = A;
				int tester = 1;
				while (t >= 10) {
					t = t / 10;
					base++;
					tester *= 10;
				}

				for (int c = 0; c < allNumbers.size() - 10; c++) {
					for (int d = c + 9; d < allNumbers.size(); d++) {
						int numToTest = allNumbers.get(d);
						for (int b = 0; b < base; b++) {
							numToTest = recycle(numToTest, tester);
							if (allNumbers.get(c) == numToTest) {
								result++;
								break;
							}
						}
					}
				}

			}
			System.out.println("Case #" + (i + 1) + ": " + result);
		}

	}

	private int recycle(int num, int base) {
		int ret = num;
		int t = num;
		ret = ((t % base) * 10) + (t / base);
		return ret;
	}

	public static void main(String[] args) {
		try {
			new Recycled();
		} catch (Exception e) {
			e.printStackTrace();
		}
	}
}
