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

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.ArrayList;

public class EnvironmentallyFriendly {

	public static void main(String[] args) throws Exception
	{
		BufferedReader br = new BufferedReader(new FileReader(new File("test.txt")));
		BufferedWriter wr = new BufferedWriter(new FileWriter(new File("output.txt")));
		int count = Integer.parseInt(br.readLine());
		int min,max;
		int total;
		String[] vals;
		for(int i=1; i<=count; i++)
		{
			total=0;
			String line = br.readLine();
			vals = line.split(" ");
			min = Integer.parseInt(vals[0]);
			max = Integer.parseInt(vals[1]);
			for(int k =min; k<max; k++)
			{
				total+=numRecyclable(k+"",max);
			}
			wr.write("Case #"+i+": "+total);
			wr.newLine();
			
		}
		wr.close();
	}

	private static int numRecyclable(String num, int max) {
		String newnum;
			
		int total =0,newval,oldval;
		ArrayList<Integer> duplicatecheck = new ArrayList<Integer>();
		for(int i=1; i<num.length(); i++)
		{
			newnum = num.substring(i)+num.substring(0, i);
			newval = Integer.parseInt(newnum);
			oldval = Integer.parseInt(num);
			if(newnum.charAt(0)!='0' && newval<=max
				&& newval > oldval && !duplicatecheck.contains(newval))
			{
				duplicatecheck.add(newval);
				total++;
			}
		}
		return total;
	}
}
