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.util.*;
import java.io.*;

public class Samir{
   public static void main(String[] args) throws Exception{
      BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
      Formatter formatter = new Formatter(System.out);
      int T = Integer.parseInt(br.readLine());
      int A,B;
      String[] lineParts;
      int lineNum=1;
      while(T-->0){
	 lineParts=br.readLine().split("\\s");
	 A=Integer.parseInt(lineParts[0]);
	 B=Integer.parseInt(lineParts[1]);
	 formatter.format("Case #%d: %d\n",lineNum++,cycles(A,B));
      }
      formatter.close();
   }
   private static int cycles(int A, int B){
      int pairs= 0;
      for(int n=A;n<B;n++){
	pairs+=solve(n,B); 
      }
      return pairs;
   }
   private static int solve(int n, int B){
      int pairs=0;
      int m=n;
      int q,r;
      int nLen=(""+n).length();
      LinkedList<Integer> restQueue=new LinkedList<Integer>();
      for(int i=0;i<nLen;i++){
	 q=m/10;
	 r=m%10;
	 m=q;
	 restQueue.add(r);
	 if(r!=0){
	    int len=(""+m).length();
	    while(!restQueue.isEmpty()){
	       m+=restQueue.removeFirst()*Math.pow(10,len++);
	    }
	    if(m>n && m <=B) pairs++;
	 }
      }
      return pairs;
   }
}
