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

}
/**
 *
 * @author amit
 */
import java.io.*;
import java.util.HashSet;
import java.util.Set;
//import java.util.Arrays;
//import java.math.BigInteger;

public class GCJ {

	BufferedReader rin;
	BufferedWriter wout;
	int numCases;

	public String calculate(long A, long B) {
		long count =0;
		for(long i=A;i<B;i++){
			String s = Long.toString(i);
			int Bl = Long.toString(B).length();
			int Al = s.length();
			//System.out.println("\n"+s);
			//System.out.println("\n" + Al + " " + Bl);
			Set<Long> set = new HashSet<Long>();
			for(int k=0;k<=Bl-Al;k++) {

				//System.out.println("\n"+s);

				
				for(int j=0;j<s.length();j++){
					//System.out.println("\nS: " + s);
					s = s.substring(s.length()-1) + s.substring(0, s.length()-1);
					//System.out.println("\nS new: " + s);
					long num = Long.parseLong(s);
					if (num>=A && num<=B && i<num) {
						if(!set.contains(num)) {
							set.add(num);
							//System.out.println("\nCounted: " + i + " " + num);
							count++;
						}
					}

				}
				//System.out.println("\nS newnew: " + s);
				s = "0" + s;
			}
		}
		return Long.toString(count);
	}

	public String getNextInput() {
		try {
			String line = rin.readLine();
			String[] aVars = line.split(" ");
			long A = Long.parseLong(aVars[0]);
			long B = Long.parseLong(aVars[1]);
			return calculate(A,B);

		} catch (IOException e) {
			System.out.println("File Error! Could not read line from file");
		}
		return null;
	}

	public void writeNextOutput(String s) {
		try {
			wout.write(s);
			wout.write("\n");
		} catch (IOException e) {
			System.out.println("Error! Could not write to the file!");
		}
	}

	public GCJ(String s1, String s2) {
		try {
			rin = new BufferedReader(
					new FileReader(s1));
			wout = new BufferedWriter(new FileWriter(s2));
			numCases = Integer.parseInt(rin.readLine());

			for(int i=1; i <= numCases; i++){
				System.out.println("case#" + i);
				String sout = getNextInput();
				sout = "Case #" + Integer.toString(i) + ":" + " " + sout;
				writeNextOutput(sout);
				//System.out.println("case#" + i);
			}
			rin.close();
			wout.close();
		} catch (IOException e) {
			System.out.println("File error");
			System.exit(0);
		}
	}

	public static void main(String[] args) {/*
        if (args.length!=2) {
        System.out.println("Enter input file!");
        System.exit(0);
        }*/
		GCJ a = new GCJ("infile.txt", "out.txt");
	}
}
