package codejam;

import java.util.*;
import java.io.*;

public class RecycledNumbers {
	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new FileReader("in.txt"));
		PrintWriter out = new PrintWriter(new File("out.txt"));
		
		int T = Integer.parseInt(in.readLine());
		for (int t = 1; t <= T; ++t) {
			String[] parts = in.readLine().split("[ ]+");
			int A = Integer.parseInt(parts[0]);
			int B = Integer.parseInt(parts[1]);
			
			int cnt = 0;
			for (int i = A; i < B; ++i) {
				String str = String.valueOf(i);
				int n = str.length();
				String res = "";
				Set<Integer> seen = new HashSet<Integer>();
				for (int j = n - 1; j > 0; --j) {
					res = str.substring(j) + str.substring(0, j);
					int k = Integer.parseInt(res);
					if (k > i && k <= B) {
						//System.out.println("(" + i + ", " + k + ")");
						if (!seen.contains(k)) {
							++cnt;
							seen.add(k);
						}
					}
				}
			}

			out.println("Case #" + t + ": " + cnt);
		}
		
		in.close();
		out.close();
		System.exit(0);
	}
}

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
//package codejam2012;

import java.io.*;
import java.util.ArrayList;

/**
 *
 * @author BUDDHIMA
 */
public class Codejam2012 {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) throws Exception {
        // TODO code application logic here

        BufferedReader br = new BufferedReader(new FileReader("C-small-attempt0.in"));
        BufferedWriter out = new BufferedWriter(new FileWriter(new File("outputC-small.txt")));

        int tests = Integer.parseInt(br.readLine());

        for (int testIndex = 1; testIndex <= tests; testIndex++) {

            int count = 0;

            String[] lineParts = br.readLine().split(" "); // A B

            if (lineParts[0].length() < 2) {
                out.write("Case #" + testIndex + ": " + 0 + "\n");
                continue;


            } else {

                int A = Integer.parseInt(lineParts[0]);
                int B = Integer.parseInt(lineParts[1]);


                for (int x = A; x < B; x++) {
                    
                    ArrayList<Integer> preAdded=new ArrayList<Integer>(); //memory
                    
                    for (int i = 1; i < lineParts[0].length(); i++) {
                        String numpart1 = String.valueOf(x).substring(0, i);
                        String numpart2 = String.valueOf(x).substring(i);

                        int newnum = Integer.parseInt(numpart2 + numpart1);
                        
                        
                        
                        if (newnum <= B && x < newnum) {
                            boolean isIn=false;
                            
                            for(int y=0;y<preAdded.size();y++){
                            if(preAdded.get(y)==newnum){
                            isIn=true;
                            break;
                            }
                            }
                            
                            if(!isIn){
                            System.out.println(x + "-->" + newnum);
                            count++;
                            preAdded.add(newnum);
                            isIn=false;
                            }
                        }



                    }
                }

            }

//print results
            out.write("Case #" + testIndex + ": " + count + "\n");

        }



        out.close();
    }
}
