
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.code.jam;

import java.io.BufferedReader;
import java.io.DataInputStream;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;

public class RecycledNumbers {

	FileInputStream in;
	FileOutputStream out;
	BufferedReader br;

	void open() throws IOException {
		in = new FileInputStream(new File(
				"/home/lenovo/Documents/GCJ/C-small-attempt0.in"));
		out = new FileOutputStream(new File(
				"/home/lenovo/Documents/GCJ/C-small-attempt0.out"));

		br = new BufferedReader(new InputStreamReader(new DataInputStream(in)));

	}

	void close() throws IOException {
		out.close();
	}

	void run() throws IOException {
		int tn = new Integer(br.readLine());
		for (int i = 1; i <= tn; i++) {

			// System.out.println(br.readLine());
			String AB = br.readLine();
			BigInteger A = new BigInteger(AB.split(" ")[0]);
			BigInteger B = new BigInteger(AB.split(" ")[1]);

			int count = 0;
			Map nm = new HashMap();
			
			
			
			for (BigInteger k = A; k.compareTo(B) ==  -1; k = k
					.add(BigInteger.ONE)) {

				String n = k.toString();
				String	m = n;
				nm.clear();
				
				
				for(int l=0;l<n.length();l++)
				{
							m  = rotateDigitRight(m);
					
							BigInteger mBig = new BigInteger(m);
					
						if (mBig.compareTo(k) >0 && mBig.compareTo(B) <= 0 && mBig.compareTo(A) >0 && !nm.containsValue(m) )
						{
							count++;							
							
							nm.put(n, m);
							
							System.out.println(n + ", " +m+"   "+ count);
						
						}	
				}
					
				}
				

							
							
							
			

			out.write(("Case #" + i + ": " + count).getBytes());
			out.write("\n".getBytes());
		}

	}

	public static String rotateDigitRight(String A) {

	
		String val = A.toString();
		
		String val0 = String.valueOf(val.charAt(val.length()-1));
		
		
		
		String valRest = "";
		if(val.length()>=2)
		{
			 valRest = val.substring(0, val.length()-1);
		}

		
		val = val0 + valRest;
		
		
		return val;

	}

	public static void main(String[] args) throws IOException {
		RecycledNumbers solution = new RecycledNumbers();
		solution.open();
		solution.run();
		solution.close();
	}

}
