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

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Stack;

public class Q3 {
	public static void main(String[] args)throws IOException {
		FileReader buf=new FileReader("C-small.in");
		BufferedReader br=new BufferedReader(buf);
		int cases=Integer.parseInt(br.readLine());
		String[] output=new String[cases];
		for(int i=1;i<=cases;i++){
			int ctr=0;
			String input=br.readLine();
			String[] splits=input.split(" ");
			int A=Integer.parseInt(splits[0]);
			int B=Integer.parseInt(splits[1]);
			for(int n=A;n<=B;n++){
				String temp=n+""+n;
				for(int m=n+1;m<=B;m++){
					String temp2=m+"";
					if(temp.contains(temp2)){
						ctr++;
					}
				}
			}
			if(i!=cases)
			output[i-1]="Case #"+i+": "+ctr+"\n";
			else
			output[i-1]="Case #"+i+": "+ctr;	
		}
		br.close();
		buf.close();
		 FileWriter buf1 = new FileWriter(new File ("C-small_Output.txt"), true);
		 BufferedWriter bw1=new BufferedWriter(buf1);
		for(int i=0;i<cases;i++){
			bw1.write(output[i]);
		}
		bw1.close();
		buf1.close();
	}

}
