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

}
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.IOException;
import java.nio.charset.Charset;
import java.nio.file.Files;
import java.util.*;

//RecycledNumbers.java
//Completes the Recycled Numbers problem for Google Code Jam 2012
//By Jack Thakar
//Coded in Java using Eclipse 3.7
public class RecycledNumbers {
	public static void main(String[] args){
		String input = readFile("C-small-attempt0.in");
		String[] lines = input.split(System.lineSeparator());
		String output = "";
		for(int i=1;i<lines.length;i++){
			String line = lines[i];
			Case c = (new RecycledNumbers()).new Case(line);
			output+="Case #"+i+": ";
			output+=c.getSolution();
			if(i<lines.length-1) output+=System.lineSeparator();
		}
		writeFile("C-small-attempt0.out",output);
	}
	class Case{
		int a;
		int b;
		public Case(String data){
			String[] parts = data.split(" ");
			a = Integer.parseInt(parts[0]);
			b = Integer.parseInt(parts[1]);
		}
		public int getSolution(){
			List<Integer> foundM = new ArrayList<Integer>(),foundN = new ArrayList<Integer>();
			int count = 0;
			for(int n=a;n<=b;n++){
				String ni = Integer.toString(n);
				for(int j=1;j<ni.length();j++){
					String mi = ni.substring(j)+ni.substring(0,j);
					int m = Integer.parseInt(mi);
					boolean used = false;
					for(int i=0;i<foundM.size();i++){
						if(foundM.get(i).intValue()==m&&foundN.get(i).intValue()==n) used = true;
					}
					if(n<m&&m>=a&&m<=b&&used==false) {
						foundM.add(m);
						foundN.add(n);
						count++;
					}
				}
			}
			return count;
		}
	}
	
	private static String readFile(String name){
		File file = new File("input"+File.separator+name);
		Charset charset = Charset.forName("ASCII");
		String text = "";
		try (BufferedReader reader = Files.newBufferedReader(file.toPath(), charset)) {
		    String line = null;
		    while ((line = reader.readLine()) != null) {
		        text+=line+System.lineSeparator();
		    }
		} catch (IOException e) {
		}
		return text;
	}
	private static void writeFile(String name, String data){
		File file = new File("output"+File.separator+name);
		Charset charset = Charset.forName("ASCII");
		try (BufferedWriter writer = Files.newBufferedWriter(file.toPath(), charset)) {
		    writer.write(data, 0, data.length());
		} catch (IOException e) {
		}
	}
}
