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

public class Recycler {
	
	public static void main(String[] args) {
		
		Recycler rec = new Recycler();
		String line = "";
		BufferedReader br;
		BufferedWriter output;
		FileWriter fstream;
		int x;
		int y;
		
		try {
			br = new BufferedReader(new FileReader("C-small-attempt0.in"));        
			line = br.readLine();
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		} catch (IOException e) {
			e.printStackTrace();
		}
		
		rec.testCases = Integer.parseInt(line);
		
		try {
			fstream = new FileWriter("output.txt");
			output = new BufferedWriter(fstream);
			br = new BufferedReader(new FileReader("C-small-attempt0.in"));
			br.readLine();
			for(int i = 1; i <= rec.testCases ;i++) {
				line = "";
				line = br.readLine();
				int j = 0;
				while( line.charAt(j) != ' ')
					j++;
				x = Integer.parseInt(line.substring(0, j));
				y = Integer.parseInt(line.substring(j+1));
				
				output.write("Case #" + i + ": " +  rec.countPairs(x, y));
				output.newLine();
			}
			output.close();
				
		} catch (IOException e) {
			e.printStackTrace();
		}
	}
	
	private int countPairs(int A, int B) {
		int counter = 0;
		for(int i = A; i < B; i++) {
			for(int j = i+1; j <= B; j++){
				if(checkR(i,j)){
					counter++;
				}
			}
		}
		return counter;
	}
	
	private boolean checkR(int num1, int num2){
		String n = Integer.toString(num1) ;
		String m = Integer.toString(num2) ;
		boolean isPair = false;
		
		for(int i = m.length()-1; i > 0;i--){
			String s = n.substring(i);
			String ss = n.substring(0, i);
			String sss = s + ss;
			if(sss.equals(m)) {
				isPair = true;
				
			}
		}	
		return isPair;
	}
	
	/* private instance variables */
	private int testCases;

}
