import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;


public class Main {

//	static int MAX = 10000;
	static int MAX = 2000000;
	static Object[] All = new Object[MAX+1];
	
	static int size( int x ) {
		if(x>999999) return 7;
		if(x>99999)  return 6;
		if(x>9999)   return 5;
		if(x>999)    return 4;
		if(x>99)     return 3;
		if(x>9)      return 2;
		return 1;
	}
	static int[] rotate( int value ) {
		List<Integer> result = new ArrayList<Integer>();
		int[] V = new int[8];
		int s = size(value);
		int x = value;
		
		for(int i=s-1;i>=0;i--) {
			V[i] = x%10;
			x /=10;
		}
		int rot;
		for(int i=1; i<s; i++) {
			if(V[i]!=0){
				rot=0;
				for(int j=0,ii=i;j<s; j++,ii=(ii+1)%s){
					rot=rot*10+V[ii];
				}
				if(rot>value && !result.contains(rot))
					result.add(rot);
			}
		}
		if( result.isEmpty() )
			return null;
		int[] r = new int[result.size()];
		for(int i=0; i<r.length; i++)
			r[i]=result.get(i);
		return r;
	}
	
	static void precalculate() {
		for(int i=1; i<=MAX; i++){
			All[i] = rotate(i);
		}
	}
	static int solve( Scanner in ) {
		int A, B, sol=0;
		
		A = in.nextInt();
		B = in.nextInt();

		for( int i=A; i<=B; i++) {
//			List<Integer> result = rotate(i);
			if( All[i]!=null ) {
				for(int value: (int[])All[i] ) {
					if( value <= B )
						sol++;
				}
			}
		}

		return sol;
	}
	
	public static void main ( String args[] ) {
		int T; 
		Scanner in = new Scanner(System.in);
		T = in.nextInt();
		int cnt=0;
		int sol;
		precalculate();
		for( cnt=1; cnt<=T; cnt++ ) {
			sol = solve( in );
			System.out.printf("Case #%d: %d\n", cnt, sol);
		}

	}
}

import java.io.*;
public class Recycle
{
int t=0,A=0,B=0;
String output="";
int count=1;
public void readFile(String fn)
{
String data="";
try{
File in=new File(fn);
BufferedReader br=new BufferedReader(new InputStreamReader(new FileInputStream(in)));
data=br.readLine();
t=Integer.parseInt(data);
while(count<=t)
{
data=br.readLine();
String s[]=data.split(" ");
A=Integer.parseInt(s[0]);
B=Integer.parseInt(s[1]);
computeRecycle();
count++;
}

br.close();
  }catch(Exception e){}
}

public static void main(String args[])
{
Recycle rc=new Recycle();
rc.readFile(args[0]);
rc.writeToFile();
}

public void computeRecycle()
{

int sum=0;
for(int i=A;i<=B;i++)
{
  String s=""+i;
  String t=s;
  int nm=0;
  int l=s.length();
  do
  {
  char c[]=t.toCharArray();
  char ch=c[0];
  for(int j=0;j<l-1;j++)
  {
   c[j]=c[j+1];   
  }
  c[l-1]=ch;

  t=new String(c);
  nm=Integer.parseInt(t);
   if(nm!=i && nm>=A && nm<=B)
   {
      sum++;
   }
  }while(nm!=i);
  
    
}

sum=sum/2;
output+="Case #"+count+": "+sum+"\n";

}


public void writeToFile(){
    try {
      File fout= new File("output.in");
      DataOutputStream dos = new DataOutputStream(new FileOutputStream(fout));
      dos.writeBytes(output);
      dos.close();
    } catch (Exception ex) {}

  }


}