/*
 * 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.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.Hashtable;


public class RecycleNumber_1 {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		
		try {
			BufferedReader br = new BufferedReader(new FileReader("/Users/kushal/Downloads/C-small-attempt1.in"));
			PrintWriter pr = new PrintWriter("/Users/kushal/Desktop/recycle.out");
			String line = "";
			br.readLine();
			int start;
			int end;
			int count;
			int number = -1;
			int temp , p1, p2;
			String str;
			int z = 1;
			HashSet<String> hash = new HashSet<String>();
			ArrayList<Integer> digits;
			while((line = br.readLine()) != null)
			{
				start = Integer.parseInt(line.split(" ")[0]);
				end = Integer.parseInt(line.split(" ")[1]);
				digits = new ArrayList<Integer>();
				count = 0;
				hash.clear();
				for(int i=start; i<=end; i++)
				{
				
					number = i;
					//hash.add(i);
					
					if(i == 121)
					{
						//System.out.println(i+"kk");
					}
					digits = new ArrayList<Integer>();
					while(number > 0)
					{
						digits.add(number%10);
						number /= 10;
					}
					number = digits.get(digits.size() - 1);
					for(int j = digits.size() - 2 ;j >= 0; j--)
					{
						str = "" + digits.get(j);
						if(j == 0 )
						{
							p1 = digits.size() -1;
						}
						else
						{
							p1 = j - 1;
						}
						str += "" + digits.get(p1);
						while(true)
						{							
							if(p1 == 0)
							{
								p1 = digits.size() -1;
							}
							else
							{
								p1 = p1 - 1;
							}
							if(p1 == j)
							{
								break;
							}
							str += "" + digits.get(p1);
						}
						//System.out.print(str + "\t");
						if(!str.startsWith("0"))
						{
							temp = Integer.parseInt(str);
							if((temp < i) && (temp >= start) && (temp <= end))
							{
								if(!hash.contains(i+"_"+temp))
								{
									hash.add(i+"_"+temp);
									//System.out.println(i + " "+ count);
									//continue;
									count++;
								}
							}
						}
					}
					//System.out.println();
				}
				System.out.println("Case #"+z+": "+count);
				z++;
			}
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
	}

}
