
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 gcj2012.qr;

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

public class RecycledNumbers {
	
	public static int count(int a, int b) {
		int r = 0, len, m;
		String sn, sm;
		Set<Integer> used = new HashSet<Integer>();
		for (int n = a; n < b; n++) {
			used.clear();
			sn = Integer.toString(n);
			len = sn.length();
			sn = sn + sn;
			for (int i = 1; i < len; i++) {
				if (sn.charAt(i) == '0') continue;
				sm = sn.substring(i, i + len);
				m = Integer.parseInt(sm);
				if ((m > n) && (m <= b) && !used.contains(m)) {
					r++;
					used.add(m);
				}
			}
		}
		return r;
	}

	public static void main(String[] args) throws NumberFormatException, IOException {
		if (args.length < 1 ) {
			System.out.println("File name not given");
			System.exit(1);
		}
		BufferedReader br = new BufferedReader(new FileReader(args[0]));
		int t = Integer.parseInt(br.readLine());
		for (int i = 1; i <= t; i++) {
			String[] test = br.readLine().split(" ");
			int a = Integer.parseInt(test[0]);
			int b = Integer.parseInt(test[1]);
			System.out.printf("Case #%d: %d\n", i, count(a, b));
		}
		br.close();
	}

}
