/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package gcj;

import java.io.File;
import java.io.FileWriter;
import java.util.ArrayList;
import java.util.Scanner;

/**
 *
 * @author daniele
 */
public class GCJ_C {
    
    public static void main(String[] args) throws Exception{
        
        
        
        Scanner in = new Scanner(new File(args[0]));
        FileWriter out = new FileWriter("/home/daniele/Scrivania/Output");
        

        int prove=in.nextInt();
        int min,max;
        int cifre;
        int cifreaus;
        String temp;
        int aus;
        int count=0;
        ArrayList<Integer> vals = new ArrayList<Integer>();
        int jcount=0;
        ArrayList<Integer> perm = new ArrayList<Integer>();
        
        out.write("");
        out.flush();
        
        for(int i=1;i<=prove;i++){
            
            out.append("Case #" +i+": ");out.flush();
            
            min=in.nextInt();
            max=in.nextInt();
            
            for(int j=min;j<=max;j++){
               if(!vals.contains(j)){
                    temp=""+j;
                    cifre=temp.length();
                    aus=j;
                    perm.add(j);
                    for(int k=1;k<cifre;k++){
                        aus=rotateOnce(aus);
                        temp=""+aus;
                        cifreaus=temp.length();//elusione zeri iniziali
                        if(aus>=min && aus<=max && aus!=j && cifreaus==cifre && nobody(vals,perm)){ 
                            perm.add(aus);
                            jcount ++;
                            
                        }
                        
                    }
                    while(jcount>0){count+=jcount; jcount--;}
                    vals.addAll(perm);
                    perm= new ArrayList<Integer>();
                    
                }
            }
            out.append(count+"\n");out.flush();
            count=0;
            vals= new ArrayList<Integer>();
        }
        
        
        
    }
        static public int rotateOnce(int n){
            String s=""+n;
            if(s.length()>1){
                s=s.charAt(s.length()-1) + s.substring(0,s.length()-1);
                n=Integer.parseInt(s);
            }
            return n;
        }    
        
        static public boolean nobody(ArrayList<Integer> v,ArrayList<Integer> a){;
            for(int i=0;i<a.size();i++)
                if(v.contains(a.get(i))) return false;
            return true;
        } 
    
}


import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.StreamTokenizer;
import java.lang.reflect.Array;
import java.util.ArrayList;


public class C {

	private static ArrayList<Byte> makeCycle(ArrayList<Byte> digits) {
		if (digits.size() == 1) {
			return new ArrayList<Byte>(digits);
		}
		
		ArrayList<Byte> cycle = new ArrayList<Byte>();
		int tail = 0;
		
		while (tail < digits.size() && digits.get(tail) == 0) {
			++tail;			
		}
		
		cycle = new ArrayList<Byte>(digits.subList(tail + 1, digits.size()));
		
		for (int i = 0;i <= tail; ++i) {
			cycle.add(digits.get(i));
		}
		
		return cycle;
	}
	
	private static boolean sequenceEquals(ArrayList<Byte> sec1, ArrayList<Byte> sec2) {
		for (int i = 0;i < sec1.size(); ++i) {
			if (sec1.get(i) != sec2.get(i)) {
				return false;
			}
		}
		return true;
	}
	
	private static long value(ArrayList<Byte> digits) {
		long val = 0;
		long pow = 1;
		
		for (int i = 0;i < digits.size(); ++i) {
			val += digits.get(i) * pow;
			pow *= 10;
		}
		
		return val;
	} 
	
	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		StreamTokenizer tokenizer = new StreamTokenizer(in);

		int tests;
		
		tokenizer.nextToken();
		tests = (int)tokenizer.nval;
		
		int[] answers = new int[tests];
		
		for (int i = 0;i < tests; ++i) {
			long A, B;
			
			tokenizer.nextToken();
			A = (long)tokenizer.nval;
			
			tokenizer.nextToken();
			B = (long)tokenizer.nval;			
			
			for (long n = A; n <= B; ++n) {
				ArrayList<Byte> digits = new ArrayList<Byte>();
				
				long v = n;
				
				while (v > 0) {
					digits.add(Byte.valueOf(Long.toString(v % 10)));
					v = v / 10;
				}				
								
				ArrayList<Byte> cycled = new ArrayList<Byte>(digits);
				
				while (!sequenceEquals(cycled = makeCycle(new ArrayList<Byte>(cycled)), digits)) {
					long val = value(cycled);
					if (val <= B && val > n) {
						++answers[i];
					}
				}
			}
		}
		
		for (int i = 0;i < tests; ++i) {
			System.out.println("Case #" + (i + 1) + ": " + answers[i]);
		}
	}

}
