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

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;

public class Main {

	public static void main(String[] args) {
		int T;
		try {
			BufferedReader in = new BufferedReader(new FileReader("C-small-attempt0.in"));
			PrintWriter out = new PrintWriter(new BufferedWriter(
					new FileWriter("out")));
			String strLine;
			String outLine;
			strLine = in.readLine();
			T = Integer.valueOf(strLine);
			for (int i = 0; i < T; i++) {
				strLine = in.readLine();
				String result = "";
				String[] stringArray = strLine.split(" ");
				// char[] charArray = strLine.toCharArray();
				int A = Integer.valueOf(stringArray[0]);
				int B = Integer.valueOf(stringArray[1]);
				int count = 0;
				for (int j = A; j <= B; j++) {
					for (int k = j+1; k <= B; k++) {
						if(isRecycledNumber(j,k))
							count++;
					}
				}

				outLine = "Case #" + (i + 1) + ": " + count;
				out.println(outLine);
			}
			in.close();
			out.flush();
			out.close();

		} catch (IOException e) {
			e.printStackTrace();
		}

	}

	private static boolean isRecycledNumber(int j, int k) {
		String jStr = String.valueOf(j);
		String newStr;
		for(int i=1;i<jStr.length();i++){
			newStr= jStr.substring(i)+jStr.substring(0,i);
			if(k == Integer.valueOf(newStr))
				return true;
		}

		return false;
	}

}
