import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;

public class CopyOfCopyOfMain {

	static int ndigits(int n) {
		return (int) (Math.log10(n) + 1);
	}

	static int rot(int n, int dig) {
		return (int) ((n % 10) * Math.pow(10, dig - 1)) + (int) (n / 10);
	}

	public static void main(String[] args) throws FileNotFoundException {
		String file = "C-large";
		Scanner in = new Scanner(new File(file + ".in"));
		PrintWriter out = new PrintWriter(new File(file + ".out"));

		int T = in.nextInt();
		for (int t = 1; t <= T; t++) {
			int A = in.nextInt();
			int B = in.nextInt();

			int c = 0;
			int[] list = new int[ndigits(B)];
			numbers: for (int i = A; i <= B; i++) {
				int digs = ndigits(i);
				int rot = i;
				int pairs = 0;

				Arrays.fill(list, -1);
				list[0] = i;

				digits: for (int j = 1; j <= digs + 1; j++) {

					rot = rot(rot, digs);
					if(rot < i)
						continue;

					if (A <= rot && rot <= B) {
						for (int k = 0; k < j; k++) {
							if (list[k] == rot) {
								continue digits;
							}
						}
						pairs++;
						list[j] = rot;
					}
				}

				//c += pairs * (pairs + 1) / 2;
				c += pairs ;
				// c+=digs;
			}
			out.println("Case #" + t + ": " + c);
		}

		in.close();
		out.close();
	}
}

import java.util.*;
import java.io.*;
public class Josephus {
   public static void main(String[] args)throws IOException {
     FileInputStream is = null;
     try {
       is = new FileInputStream("input.txt");
       DataInputStream in = new DataInputStream(is);
       BufferedReader br = new BufferedReader(new InputStreamReader(in));
       String str;
       int n;
       String sn;
       int m;
       String sm;
       int counter = 0;
       int loop = Integer.parseInt(br.readLine());
       ArrayList<Integer> nlist = new ArrayList<Integer>();
       ArrayList<Integer> mlist = new ArrayList<Integer>();
       
       for (int i = 0 ; i < loop ; i++)  {
         str = br.readLine();
         n = Integer.parseInt(str.substring(0,str.length()/2));
         m = Integer.parseInt(str.substring(str.length()/2+1,str.length()));
         for (int k = n ; k < m ; k++){
           String current = Integer.toString(k);
           for (int j = 0; j< current.length()-1; j++){
             char c = current.charAt(0);
             current += c;
             
             current = current.substring (1,current.length());
             int check = Integer.parseInt(current);
             if (check > k && check <= m){
               nlist.add(k);
               mlist.add(check);
              // System.out.println(k+" , "+current);
               counter++;
              }
           }
         }
         System.out.println("Case #"+(i+1)+": "+counter);
         //System.out.println(nlist);
         //System.out.println(mlist);
         counter = 0; 
       }
 
       in.close();
     }catch (Exception e){//Catch exception if any
       System.err.println("Error: " + e.getMessage());
     }
   }
}