
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 com.google.codejam;

import java.util.HashSet;
import java.util.Set;

import com.google.codejam.util.CodeJamInputFile;
import com.google.codejam.util.CodeJamOutputFile;

public class Recycle {

	
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Integer count;
		CodeJamInputFile f = new CodeJamInputFile("in/C-small-attempt0.in");
		CodeJamOutputFile fo = new CodeJamOutputFile("out/C-small.out");

		for(int c = 0; c < f.getCases(); c++){
			count = 0;
			Set<String> tested = new HashSet<String>();
			String[] range = f.getLine().split(" ");
			Integer a = Integer.valueOf(range[0]);
			Integer b = Integer.valueOf(range[1]);
			
			for(Integer i = a; i < (b + 1); i++){
				String str = i.toString();
				tested.add(str.concat(str));
				for(int j = 1; j<str.length(); j++){
					String newstr = str.substring(j).concat(str.substring(0, j));
					if(tested.contains(str.concat(newstr)) || tested.contains(newstr.concat(str))){
						continue;
					}
					tested.add(str.concat(newstr));
					Integer testval = Integer.valueOf(newstr);
					if(testval >= a && testval <= b){
						//System.out.println(str + " - " + newstr);
						count++;
					}
				}
			}
			
			fo.writeCase(c, count.toString());
		}
		f.close();
		fo.close();
	}

}
