
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.*;
import java.util.*;


class ProblemC
{



  public static void main(String[] args) throws IOException
  {
	FileReader fr = new FileReader(args[0]);
	BufferedReader br = new BufferedReader(fr);
	String[] splittArray;
	int[] points;
	int A,B,res;
	int T = Integer.parseInt(br.readLine());
	//System.out.println(T);

	String dummy;
	String result="";
	for(int i=1;i<=T;i++) {
		dummy=br.readLine();
		splittArray=dummy.split(" ");
		A=Integer.parseInt(splittArray[0]);
		B=Integer.parseInt(splittArray[1]);
		res=0;
		for(int j=A;j<B;j++) {
			
			res+=permutes(j,new Integer(j).toString(),B);
		}
		
		result+="Case #"+i+": "+res;
		if(i<T) result+="\r\n";
	}
	br.close();





	FileWriter writer;
  	File file;
  
	     file = new File(args[1]);
     try {
      
       writer = new FileWriter(file ,true);
       
       // Text wird in den Stream geschrieben
      
       writer.write(result);
       
       
       // Schreibt den Stream in die Datei
       // Sollte immer am Ende ausgefÃ¼hrt werden, sodass der Stream 
       // leer ist und alles in der Datei steht.
       writer.flush();
       
       // SchlieÃt den Stream
       writer.close();
    } catch (IOException e) {
      e.printStackTrace();
    }
	
  }

public static int permutes(int b,String a,int c) {
	LinkedList<Integer> result=new LinkedList<Integer>();
	String dummy;
	int dummy2;

	for(int i=1;i<=a.length()-1;i++) {
		dummy=a.substring(i,a.length())+a.substring(0,i);
		dummy2=Integer.parseInt(dummy);
		if(dummy2>b && dummy2<=c && !result.contains(dummy2)) result.add(dummy2);
	}

	return result.size();
}
	

}

