import java.io.FileInputStream;
import java.util.HashMap;
import java.util.Scanner;
import java.util.TreeSet;

// Recycled Numbers
// https://code.google.com/codejam/contest/1460488/dashboard#s=p2

public class C {

	private static String process(Scanner in) {
		int A = in.nextInt();
		int B = in.nextInt();
		int res = 0;
		int len = Integer.toString(A).length();
		for(int n = A; n < B; n++) {
			String str = Integer.toString(n);
			TreeSet<Integer> set = new TreeSet<Integer>();
			for(int i = 1; i < len; i++) {
				int m = Integer.parseInt(str.substring(i, len) + str.substring(0, i));
				if ( m > n && m <= B && ! set.contains(m) ) {
					set.add(m);
					res++;
				}
			}
		}
		return Integer.toString(res);
	}

	public static void main(String[] args) throws Exception {
		Scanner in = new Scanner(System.in.available() > 0 ? System.in : 
			new FileInputStream(Thread.currentThread().getStackTrace()[1].getClassName() + ".practice.in"));
		int T = in.nextInt();
		for(int i = 1; i <= T; i++) 
			System.out.format("Case #%d: %s\n", i, process(in));
	}
}

import java.io.BufferedReader;
import java.io.File;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.*;


public class GoogleCodeInP3{
    
    //processing file
    public static void main(String[] args) throws IOException {
        BufferedReader dog = new BufferedReader(new FileReader(args[0]));
        int a = -1;
        try {
            a = Integer.parseInt(dog.readLine());
        }
        catch (Exception e) { }
        FileWriter file = new FileWriter("outputFile8");
        BufferedWriter cat = new BufferedWriter(file);
        for (int i = 0; i < a; i++) {
            String line = dog.readLine();
            String[] barf= line.split(" ");
            cat.write("Case #" + (i + 1) + ": " + GoogleCodeInP3.solver(Integer.parseInt(barf[0]),Integer.parseInt(barf[1])));
            if (i < a - 1) { 
                cat.write("\n"); 
            }
        }
        cat.close();
    }
    
    
    
    public static int solver(int a, int b){
        int totalRecycledPair = 0; // returns the total number of recyled pairs 
        int m= a+1;
        for (int n= a; n < m; n++){
               for (m= n + 1; m < b+1; m++){
                   if ((m+"").length() == (n+"").length()){
                       String interN= n+"";
                       if (Integer.parseInt(interN) == m){
                           totalRecycledPair++;
                       }
                       for (int i= 0; i < interN.length(); i++){
                           interN= interN.charAt(interN.length()-1) + interN.substring(0,interN.length()-1);
                           if (Integer.parseInt(interN) == m){
                               totalRecycledPair++;
                           }
                       }
                   }
                }
         }
       return totalRecycledPair;
    }
}