
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.DataInputStream;
import java.io.FileInputStream;
import java.io.InputStreamReader;


public class Recycled {

	
	public static void main(String[] args){
		Recycled r = new Recycled();
		try{
			  // Open the file that is the first 
			  // command line parameter
			  FileInputStream fstream = new FileInputStream("C-small-attempt1.in");
			  // Get the object of DataInputStream
			  DataInputStream in = new DataInputStream(fstream);
			  BufferedReader br = new BufferedReader(new InputStreamReader(in));
			  String strLine;
			  //Read File Line By Line
			  
			  int numOfTests = Integer.parseInt(br.readLine());
			  for(int i=1; i<=numOfTests; i++){
				  String itemString = br.readLine();
				  System.out.print("Case #"+i+": ");
				  long A = Long.parseLong(itemString.split(" ")[0]);
				  long B = Long.parseLong(itemString.split(" ")[1]);
				  r.countRecycled(A,B);
				  System.out.println();
			  }
			  //Close the input stream
			  in.close();
		}catch (Exception e){//Catch exception if any
			  System.err.println("Error: " + e.getMessage());
		}
	}

	private char[] shuffle(char[] numString){
		//char[] numString = (x+"").toCharArray(); 
		int i=0; 
		char temp=numString[i];
		for(i=0; i<numString.length-1; i++){
			numString[i]=numString[i+1];
		}
		numString[i]=temp;
		return numString;
	}
	private void countRecycled(long a, long b) {
		long count = 0;
//		System.out.println(a+"  "+b);
		for(long i=a; i<b; i++){
			char[] shuffleChar =(i+"").toCharArray();
			long shuffleNum = Long.parseLong(new String(shuffleChar));
			for(int j=0; j<(i+"").length()-1; j++){
				shuffleChar = shuffle(shuffleChar);
				shuffleNum = Long.parseLong(new String(shuffleChar));
				if(shuffleNum > a && shuffleNum > i && shuffleNum <=b ){
//						System.out.print(" "+i);
//						System.out.println(" shuffle: "+shuffleNum);
						count++;
				}
			}
		}
//		System.out.println();
		System.out.print(count);
	}

}
