import java.util.Scanner;
import java.io.*;
import java.lang.Math;


public class C{
	public static int recycle(String str){
		String[] numbers = str.split(" ");
		int min = Integer.parseInt(numbers[0]);
		int max = Integer.parseInt(numbers[1]);
		int ret = 0;

		for(int i = min; i < max; i++){
			String num = i + "";
			int len = num.length();
			int k = i;
			for(int j = 1; j < len; j++){
				k = (k/10) + (int)java.lang.Math.pow(10.0,(double)(len-1))*(k%10);
				if (k > i && k <= max)
					ret++;
				else if(k == i)
					break;
			}
		}

		return ret;
	}

	public static void main(String[] args){
		Scanner sc = null;
		String next;
		int out;
		try{
			sc = new Scanner(new File("C-large.in"));
			int cases = Integer.parseInt(sc.nextLine());
			int current = 0;
			

			FileWriter fs = new FileWriter("output.txt");
			BufferedWriter buff = new BufferedWriter(fs);
			while(current < cases){
				next = sc.nextLine();
				current++;
				out = recycle(next);
				buff.write("Case #" + current + ": " + out + "\n");
			}
			buff.close();
		}
		catch(Exception ex){}
	}
}
import java.io.*;
import java.util.*;
public class Main{
    public static void main (String[] args) throws java.lang.Exception{
      Scanner in = new Scanner(System.in);
      int T=in.nextInt();
      int res[]=new int[T];

      for(int t=0;t<T;t++){
          int A=in.nextInt();
          int B=in.nextInt();
          for(int i=A;i<=B;i++){
              HashSet<Integer> hs=new HashSet<Integer>();
              String tt=i+"";
              int lenT=tt.length();
              int len=lenT-1;
              int temp=i;
              while(len>0){
                  len--;
                  int rem=temp%10;
                  temp=temp/10;
                  if(rem!=0)
                    temp=rem*(int)Math.pow(10,lenT-1)+temp;
                  if(temp<=B && temp>i){  
                        hs.add(temp);
                  }
              }
              res[t]+=hs.size();
          }
      }
      for(int i=0;i<T;i++){
          System.out.println("Case #"+(i+1)+": "+res[i]);
      }

     
    }
}