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

public class Recycled {
    public static void main(String[] args) {
        try {
            BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
            int t = Integer.parseInt(br.readLine());
            for (int i = 0; i < t; i++) {
                String[] str = br.readLine().split(" ");
                int a = Integer.parseInt(str[0]);
                int b = Integer.parseInt(str[1]);
                System.out.println("Case #" + (i + 1) + ": " + find(a, b));
            }
        } catch (IOException e) {
            e.printStackTrace();
        }
    }

    private static int find(int a, int b) {
        HashSet<Long> used = new HashSet<Long>();
        int digits = String.valueOf(a).length();
        if (digits == 1) return 0;
        for (int i = a; i <= b; i++) {
            int s = 10;
            int m = (int) Math.pow(10, digits-1);
            for (int j = 0; j < digits-1; j++) {
                int r = i % s;
                if (r < s/10) continue;
                int q = i / s;
                int rn = r * m + q;
                s *= 10; m /= 10;
                if (i != rn && rn >= a && rn <= b) {
                    long pp;
                    if (rn < i) pp = (long)rn << 30 | i;
                    else pp = (long)i << 30 | rn;
                    if (!used.contains(pp)) {
                        used.add(pp);
                    }
                }
            }
        }
        return used.size();
    }
}

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



public class Recycled_Numbers {
	public static void main(String[] args) throws IOException {
BufferedReader reader=new BufferedReader(new InputStreamReader(System.in));
String x=reader.readLine();
long cases=Long.parseLong(x);
Hashtable <Long,Long>hash=new Hashtable<Long, Long>();
String input="";
long a=0;
String result="";
long b=0;
long i=a;
String temp="";
String ctemp="";
long counter=0;
String []array;
for(int j=0;j<cases;j++){
	input=reader.readLine();
	array=input.split(" ");
	a=Long.parseLong(array[0]);
	b=Long.parseLong(array[1]);
	i=a;
	 temp="";
	ctemp="";
	counter=0;
while(i<=b){
temp=i+"";
hash.clear();
for(int k=1;k<temp.length();k++){
ctemp=temp.substring(k,temp.length())+temp.substring(0,k);	
if((i<Long.parseLong(ctemp))&&(Long.parseLong(ctemp)<=b)){
	if(hash.get(Long.parseLong(ctemp))==null){
	hash.put(Long.parseLong(ctemp), Long.parseLong(ctemp));
	counter++;
	}
}
}
i++;
}
result+="Case #"+(j+1)+": "+counter+"\n";
}
System.out.println(result);
}
}