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

import java.util.ArrayList;
import java.util.Scanner;

public class B {

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int n = in.nextInt();
		int t = 1;
		int a, b;
		ArrayList<Integer>[] v = new ArrayList[2000010];
		for (int i = 0; i < v.length; i++)
			v[i] = new ArrayList<Integer>();
		while (n-- > 0) {
			a = in.nextInt();
			b = in.nextInt();
			int cnt = 0;
			int x;
			String s = a + "";
			int len = s.length();
			int pow = 1;
			for (int i = 0; i < len - 1; i++)
				pow *= 10;
			for (int i = a; i <= b; i++)
				v[i].clear();
			for (int i = a; i <= b; i++) {
				x = i;
				for (int j = 0; j < len; j++) {
					if (x % 10 == 0) {
						int tm = 10;
						while (x % tm == 0) {
							tm *= 10;
						}
						x = (x % tm) * pow / (tm / 10) + x / (tm);
						if (x > i && x <= b && !v[i].contains(x)) {
							cnt++;
							v[i].add(x);
						}
					} else {
						x = (x % 10) * pow + x / 10;
						if (x > i && x <= b && !v[i].contains(x)) {
							cnt++;
							v[i].add(x);
						}
					}
				}
			}
			System.out.printf("Case #%d: %d\n", t++, cnt);
		}
	}

}