/*
 * 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.FileInputStream;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Scanner;
import java.util.StringTokenizer;



class roundThree {
    public static void main(String[] args) {
    	String text = "";
    	if( args.length > 0) {
    		text = args[0];
    	} else {
	    	try {
				FileInputStream fos = new FileInputStream( "text3.txt");
			    Scanner scanner = new Scanner(new FileInputStream("text3.txt"));
			    try {
			      while (scanner.hasNextLine()){
			        text += scanner.nextLine() + "\n";
			      }
			    }
			    finally{
			      scanner.close();
			    }
				try {
					fos.read();
				} catch (IOException e) {
					// TODO Auto-generated catch block
					e.printStackTrace();
				}
			} catch (FileNotFoundException e) {
				// TODO Auto-generated catch block
				e.printStackTrace();
			}
    	}
    
    	StringTokenizer st = new StringTokenizer(text, "[\r\n]+", false);
    	int cases = Integer.parseInt(st.nextToken());
    	
        for (int x=1; x<= cases; x++) {
        	
        	StringTokenizer st2 = new StringTokenizer(st.nextToken(), "[ ]+", false);
        	
        	int small = Integer.parseInt(st2.nextToken());
        	int large = Integer.parseInt(st2.nextToken());
        	ArrayList keep_track = new ArrayList<Integer>();
        	String small_int = "" + small;
        	int count = 0;
        	int small_length = small_int.length();
        	for( int i = small; i < large; i++) {
        		String number1 = "" + i;
        		keep_track.clear();
        		for( int j = 1; j < small_length; j++) {
        			String sub_2 = number1.substring(0,j);
        			String sub_1 = number1.substring(j,small_length);
        			int variation = Integer.parseInt( sub_1 + sub_2 );
        			if( variation > i && variation <= large && !keep_track.contains(variation)) {
        				keep_track.add(variation);
        				count++;
        			}
        		}
        	}
            System.out.println( "Case #" + x + ": " + count);
        }
    }
}