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

package recycled;

import java.io.BufferedReader;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.TreeSet;

/**
 *
 * @author Alfred
 */
public class Main {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
    try {
            FileInputStream fstream = new FileInputStream("C-small-attempt0.in");
            DataInputStream in = new DataInputStream(fstream);
            BufferedReader br = new BufferedReader(new InputStreamReader(in));
            FileWriter outFile = new FileWriter("out.txt");
            PrintWriter out = new PrintWriter(outFile);
            String line;
            line = br.readLine();
            int cases = Integer.parseInt(line);
            for (int i=1; i<=cases;i++){
                line = br.readLine();
                String[] values = line.split(" ");
                int A = Integer.parseInt(values[0]);
                int B = Integer.parseInt(values[1]);
                int total=0;
                for (int n=A; n<=B;n++){
                    TreeSet<String> solutions = new TreeSet<String>();
                    for (int k=1;k<values[1].length();k++){
                        String m = circshift(n,k);
                        int mVal = Integer.parseInt(m);
                        if(mVal<=B && mVal!=n  && mVal> n && !m.startsWith("0") && m.length()==Integer.toString(n).length() )
                        {
                            solutions.add(m);
                        }                   
                    }
                    total+=solutions.size();
                }
                out.println("Case #"+i+": "+total);
            }
            in.close();
            out.close();
        } catch (Exception e) {//Catch exception if any
            System.err.println("Error: " + e.getMessage());
        }

}

    private static String circshift(int n, int k) {
        String nString=Integer.toString(n);
        int len=nString.length();
        String m =  nString.substring(len-k)+nString.subSequence(0, len-k);
        //System.out.println(n+" "+m);
        return m;
    }

}

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


public class Numbers {
	
	public static void main(String args[])throws IOException{
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		String regex = " ";
		int T = Integer.parseInt(in.readLine());
		String str;
		String[] split;
		String[] result = new String[T+1];
		for(int x = 1; x <= T; x++){
			result[x] = "Case #" + x + ": ";
			str = in.readLine();
			split = str.split(regex);
			if(split.length < 2) {
				result[x] = result[x].concat("0");
			} else {
				result[x] = result[x].concat(Integer.toString(getNumberOfPairs(Integer.parseInt(split[0]), Integer.parseInt(split[1]))));
			}
		}
		for(int u = 1; u <= T; u++){
			System.out.println(result[u]);
		}
			
		
	}
	
	public static int getNumberOfPairs(int a, int b){
		int pairs = 0;
		for(int x = a; x < b; x++) {
			for(int y = b; y > x; y--) {
				if(isRecycledPair(x,y)){
					pairs++;
				}
			}
		}
		return pairs;
	}
	
	public static boolean isRecycledPair(int a, int b){
		boolean result = false;
		String A = Integer.toString(a);
		String B = Integer.toString(b);
		String tempA;
		if(A.length() != 1 && B.length() != 1){
			for(int x = 1; x < A.length();x++){
				tempA = A.substring(x, A.length());
				tempA = tempA.concat(A.substring(0, x));
				if(tempA.equals(B)){
					result = true;
				}
			}
		}
		return result;
		
	}

}
