
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.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Scanner;


public class QualificationQ3 {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		FileWriter fstream = new FileWriter("out.txt");
		BufferedWriter out = new BufferedWriter(fstream);

		File file = new File(args[0]);
		Scanner in = new Scanner(file);
		int T = in.nextInt();
		in.nextLine();
		for (int zz = 1; zz <= T; zz++) {

			String outputLine = process(in);
			output(out,zz,outputLine);
		}
		in.close();
		out.close();
	}

	private static String process(Scanner in) {
		
		int begin = in.nextInt();
		int end = in.nextInt();
		int counter  = 0;
		
		for (int i=begin;i<end;i++){
			ArrayList<Integer> l= generateTheQualifiedList(i,end);
			counter += l.size();
		}
		
		return ""+counter;
	}
	
	private static ArrayList<Integer> generateTheQualifiedList(int num, int end) {

		ArrayList<Integer> qualifiedNumList = new ArrayList<Integer>();
		String sNumber = "" + num;
		int len = sNumber.length();
		ArrayList<Integer> handledNumber = new ArrayList<Integer>();
		for (int i=1;i<len;i++){
			String rNumber = sNumber.substring(i) + sNumber.substring(0,i);
			int iNumber = new Integer(rNumber);
			if (iNumber>num && iNumber<=end){
				//System.out.println(num + " " +iNumber);
				if (!handledNumber.contains(iNumber)){
					handledNumber.add(iNumber);
					qualifiedNumList.add(iNumber);
				}else{
					System.out.println(iNumber);
				}
			}
		}
		
		return qualifiedNumList;
	}

	private static void output(BufferedWriter out, int zz, String formattedString) throws IOException {
		String outputLine = String.format("Case #%d: %s\n", zz,
				formattedString);
		System.out.format(outputLine);
		out.write(outputLine);
	}

}
