/*
 * 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.util.*;

public class Recycled {
	static int CAP = 2000000;
	static long[] f;
	static int[] pow = new int[]{1,10,100,1000,10000,100000,1000000};
	public static void main(String[] args){
		Scanner reader = new Scanner(System.in);
		
		int times = reader.nextInt();
		for(int k = 1; k <= times; k++){
			int n = reader.nextInt();
			int m = reader.nextInt();
			
			fill(n,m);
			
			long sum = 0;
			for(int i = n; i <= m; i++)
				sum += (f[i]*(f[i]-1))/2l;
			System.out.println("Case #"+k+": "+sum);
		}
	}
	
	public static int getRoot(int n){
		int p = -1;
		for(int i = 0; i <= 6; i++)
			if(n/pow[i] > 0)
				p = i;
		
		int x = n;
		int min = n;
		for(int i = 0; i <= p; i++){
			x = ((x%pow[p]) * 10) + x/pow[p];
			if(x/pow[p] > 0)
				min = Math.min(min, x);
		}
		
		return min;
	}
	
	public static int getRoot(int n, int low){
		int p = -1;
		for(int i = 0; i <= 6; i++)
			if(n/pow[i] > 0)
				p = i;
		
		int x = n;
		int min = n;
		for(int i = 0; i <= p; i++){
			x = ((x%pow[p]) * 10) + x/pow[p];
			if(x/pow[p] > 0 && x >= low)
				min = Math.min(min, x);
		}
		
		return min;
	}
	
	public static void fill(int n, int m){
		f = new long[2000001];
		
		for(int i = n; i <= m; i++)
			f[getRoot(i, n)]++;
	}
	
	public static void fill(){
		f = new long[2000001];
		
		for(int i = 0; i <= CAP; i++)
			f[getRoot(i)]++;
	}
}
