package codejam;

import java.util.*;
import java.io.*;

public class RecycledNumbers {
	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new FileReader("in.txt"));
		PrintWriter out = new PrintWriter(new File("out.txt"));
		
		int T = Integer.parseInt(in.readLine());
		for (int t = 1; t <= T; ++t) {
			String[] parts = in.readLine().split("[ ]+");
			int A = Integer.parseInt(parts[0]);
			int B = Integer.parseInt(parts[1]);
			
			int cnt = 0;
			for (int i = A; i < B; ++i) {
				String str = String.valueOf(i);
				int n = str.length();
				String res = "";
				Set<Integer> seen = new HashSet<Integer>();
				for (int j = n - 1; j > 0; --j) {
					res = str.substring(j) + str.substring(0, j);
					int k = Integer.parseInt(res);
					if (k > i && k <= B) {
						//System.out.println("(" + i + ", " + k + ")");
						if (!seen.contains(k)) {
							++cnt;
							seen.add(k);
						}
					}
				}
			}

			out.println("Case #" + t + ": " + cnt);
		}
		
		in.close();
		out.close();
		System.exit(0);
	}
}

import java.io.*;
import java.util.*;
public class Cre
{
 public static void main(String args[])throws FileNotFoundException,IOException
  {
      RandomAccessFile in=new RandomAccessFile("C-small-attempt0.in","r");
      FileOutputStream out= new  FileOutputStream("out.txt");
     int o=Integer.parseInt(in.readLine());
      int j=0;
     String str[]=new String[o+1];
     int res[]=new int[o];
     while((str[j]=in.readLine())!=null)
     {
       String []nos=str[j].split(" ");
       int a=Integer.parseInt(nos[0]);
       int b=Integer.parseInt(nos[1]);
       int []t=new int[b-a+1];
	    int m;
       for(int i=a,k=0;i<=b;i++,k++)t[k]=i;
       for(int i=0;i<t.length;i++)
       {
	     
		  
           String st=t[i]+"";
		   char ch[]=st.toCharArray();
		   ArrayList got=new ArrayList();
		   int g;
           for(int c=0;c<ch.length;c++)
		    { 
			   m=shift(ch);
			    int flag=1;
			   Iterator it=got.iterator();
			   while(it.hasNext())
			   {  
			    Integer inf=(Integer)it.next();
			     g=inf.intValue();
				 if(g==m) flag=0;
			   }
			   
			     if(m!=t[i]&&flag==1)
          {
		  got.add(m);
           for(int l=i+1;l<t.length;l++)
           {
              if(m==t[l])
              {
			     System.out.println(t[i]);
                    res[j]++;
                    
              }
           }
		   
          }
		  
            }
		  
       
		 
        }
      j++;
     }
     for(int i=0;i<o;i++)
    {
     out.write(("Case #"+(i+1)+": "+res[i]+"\n").getBytes());
    }
   }
   
   static int shift(char[] ch)
   {
     char temp=ch[ch.length-1];
     for(int i=ch.length-1;i>0;i--)
	  {
	    ch[i]=ch[i-1];
	  }
	  ch[0]=temp;
	  String st=new String(ch);
	  return Integer.parseInt(st);
   }

}