/*
 * 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;
        } 
    
}


package cjam.c;

import java.awt.Checkbox;
import java.io.IOException;
import java.util.ArrayList;
import java.util.HashMap;

public class Program {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		
		 java.io.BufferedReader stdin = new java.io.BufferedReader(new java.io.InputStreamReader(System.in));
	      
	       try {
			int n = Integer.parseInt(stdin.readLine());
			 ArrayList<String> l = new ArrayList<String>();
			for (int i = 0; i < n; ++i){
				String[] spt = stdin.readLine().split(" ");
				int a = Integer.parseInt(spt[0]);
				int b = Integer.parseInt(spt[1]);
				
				int res = 0;
				for (int j = a; j <= b; ++j){
					for (int k = j+1; k <= b; ++k){
						if (check(j,k)){ res++;
//						check(j,k);
//						if (j == 178) {
//							int asd = 123;
//							check(j,k);
//							asd++;
//						}
//						System.out.println(j+" "+k);
						}
					}
				}
				l.add("Case #"+(i+1)+": "+res);
				
			}
			for (String s : l) {
		    	   System.out.println(s);
		       }
		} catch (NumberFormatException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}

	}

	static boolean check(int a, int b){
		
		if (b <= a) return false;
		int x = 10;
		int n = 1;
		while (a/x > 0){
			n++;
			x *= 10;
		}

		//System.out.println(n);
		for (int i = 1; i < n; ++i){
			int c = a % pow(10,i);
			int f = pow(10,(n-i))*c;
			int g = a / pow(10,i);
			if ( f+g  == b) return true;
		}
		
		return false;
	}
	static int pow (int x, int n){
		int y = x;
		for (int i =0; i<n-1; ++i) y*=x;
		return y;
	}
}
