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

public class Main {

	char []a;
	BufferedReader in;
	StringTokenizer str = null;
	PrintWriter out;
	
	private String next() throws Exception{
		if (str == null || !str.hasMoreElements())
			str = new StringTokenizer(in.readLine());
		return str.nextToken();
	}
	
	private int nextInt() throws Exception{
		return Integer.parseInt(next());
	}
	
	public void run() throws Exception{
		in = new BufferedReader(new FileReader("in.txt"));
		out = new PrintWriter(new File("out.txt"));
		int t = nextInt();
		for(int i=1;i<=t;i++){
			solve(i);
		}
		out.close();
	}
	
	TreeSet<pair> set;
	private void solve(int x) throws Exception{
		int A = nextInt();
		int B = nextInt();
		set = new TreeSet<pair>();

		for(int i=A;i<=B;i++){
			String s = Integer.toString(i);
			for(int j=1;j<s.length();j++){
				if (s.charAt(j) == '0') continue;
				String t = s.substring(j) + s.substring(0, j);
				int k = Integer.parseInt(t);
				if (k == Integer.parseInt(s)) continue;
				if (set.contains(new pair(i, k))) continue;
				if (A <= k && k <= B){ 
					set.add(new pair(k, i));
				}
			}
		}
		out.println("Case #"+x+": " + set.size());
	}
	
	public static void main(String[] args) throws Exception{
		new Main().run();
	}
}
class pair implements Comparable<pair>{
	public int a,b;
	public pair(int a, int b){
		this.a = a;
		this.b = b;
	}
	public int compareTo(pair p){
		if (a > p.a) return 1;
		if (a < p.a) return -1;
		if (b > p.b) return 1;
		if (b < p.b) return -1;
		return 0;
	}
}