
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 egWo;

import java.util.ArrayList;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class Cs {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int T = in.nextInt();

		for (int l = 1; l <= T; l++) {
			in.nextLine();
			int n = in.nextInt();
			int m = in.nextInt();
			int count = 0;

			if ((n % 10 > 0 && n / 10 == 0)) {
				count = 0;
			} else {
				for (int i = n; i < m; i++) {
					if (i / 10 < 10) {
						int u = i % 10;
						int ten = i / 10;
						int revI = (u * 10) + ten;
						if (i < revI && revI < m) {
							count++;
						}
					} else if (i / 10 <= 100 && i / 10 >= 10) {
						int uni = (i % 100) % 10;
						int ten = (i / 10) % 10;
						int per = i / 100;
						ArrayList revI = new ArrayList();
						revI.add(ten * 100 + uni * 10 + per);
						revI.add(uni * 100 + per * 10 + ten);

						Set set = new HashSet(revI);
						for (Object j : set) {							
							if (i < ((Integer) j).intValue()
									&& ((Integer) j).intValue() <= m) {
								count++;
							}
						}
					}
				}
			}
			System.out.format("\nCase #%d: %d", l, count);
		}
	}
}
