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

public class recycled
{
  public static void main(String[] args)
  {
    Scanner in = new Scanner (System.in);
    String scases = in.nextLine(); 
    int T = Integer.parseInt(scases);
    for(int i = 1; i<(T+1); i++)
    {
      String temp1 = in.nextLine();
      String[] temp2 = temp1.split(" ");
      int low = Integer.parseInt(temp2[0]); 
      int high = Integer.parseInt(temp2[1]);
      int count = 0;
      ArrayList<String> checked = new ArrayList<String>();
      for(int test = low; test < high; test++)
      {
	String stest = Integer.toString(test);
	int len = stest.length();
	for(int pos = 1; pos < (len) ; pos++)
	{
	  String scheck = "";
	  scheck += stest.charAt(len-1);
	  scheck += stest.substring(0,len-1);
	  stest = scheck;
	  int check = Integer.parseInt(scheck);

	    if(check > test && check <= high)
	    {
	      count = count +1;
	      checked.add(scheck);
	    }

	  
	}
      }
      System.out.println("Case #"+ i +": "+count);
    }
  }

}
