import java.util.*;
import java.lang.*;
import java.math.*;
import java.io.*;

import static java.lang.Math.*;
import static java.util.Arrays.*;
import static java.util.Collections.*;

public class C{
	Scanner sc=new Scanner(System.in);

	int INF=1<<28;
	double EPS=1e-9;

	int caze, T;
	int A, B;

	void run(){
		T=sc.nextInt();
		for(caze=1; caze<=T; caze++){
			A=sc.nextInt();
			B=sc.nextInt();
			solve();
		}
	}

	void solve(){
		int ans=0;
		for(int n=A; n<=B; n++){
			int digit=(int)(log10(n)+EPS);
			int d=(int)pow(10, digit);
			// debug("n", n);
			for(int m=rot(n, d); m!=n; m=rot(m, d)){
				// debug("m", m);
				if(n<m&&m<=B){
					ans++;
				}
			}
		}
		answer(ans+"");
	}

	int rot(int n, int d){
		return n/10+n%10*d;
	}

	void answer(String s){
		println("Case #"+caze+": "+s);
	}

	void println(String s){
		System.out.println(s);
	}

	void print(String s){
		System.out.print(s);
	}

	void debug(Object... os){
		System.err.println(deepToString(os));
	}

	public static void main(String[] args){
		try{
			System.setIn(new FileInputStream("dat/C-small.in"));
			System.setOut(new PrintStream(new FileOutputStream("dat/C-small.out")));
		}catch(Exception e){}
		new C().run();
		System.out.flush();
		System.out.close();
	}
}

import java.io.*;
class RecycledNumbers
{
  void main()throws IOException
  {
      BufferedReader obj= new BufferedReader(new FileReader("C-small-attempt0.in"));
      PrintWriter p= new PrintWriter(new BufferedWriter(new FileWriter("output.txt")));
      
      int T=Integer.parseInt(obj.readLine());
      long a,b,n,m,q,order,i,count=0;String s;
      
      for(i=1;i<=T;i++)
      {
          s=obj.readLine();
          
          a=Integer.parseInt(s.substring(0,s.length()/2));
          b=Integer.parseInt(s.substring(s.length()/2+1,s.length()));
          order=s.length()/2;
          
          for(n=a;n<=b;n++)
          {
              for(q=1;q<order;q++)
              {
                  m=(long)(n%Math.pow(10,q)*Math.pow(10,order-q)+(n/Math.pow(10,q)));
                  if(m>n&&m<=b)
                   count++;
                }
         
            }
            
            p.println("Case #"+i+": "+count);
                count=0;
      }
      p.flush();
      p.close();
    }
}
