/*
 * 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.DataInputStream;
import java.io.FileInputStream;
import java.io.InputStreamReader;
import java.util.StringTokenizer;


public class Recycle {

	private BufferedReader br;
	private int numCases;
	
	public Recycle(String input){
		try{
		FileInputStream fstream = new FileInputStream(input);
		DataInputStream in = new DataInputStream(fstream);
		 br = new BufferedReader(new InputStreamReader(in));
		
		 numCases = Integer.parseInt(br.readLine());
		 
		 for(int i=0;i<numCases;i++){
			 System.out.print("Case #"+(i+1)+": ");
			this.Calculate(br.readLine());
			 
		 }
				 
		 in.close();
		}
	catch (Exception e){
		  System.err.println("Error: " + e.getMessage());
		  }
	}
	
	
	private void Calculate(String s){
		StringTokenizer st = new StringTokenizer(s);
		int start=Integer.parseInt(st.nextToken());
		int end=Integer.parseInt(st.nextToken());
		int count=0;
		for(int i=start;i<end;i++){
			for(int j=i+1;j<=end;j++){
				if(check(i,j))count++;
				
			}
		}
		System.out.println(count);
		
		
	}
	
	private boolean check(int n,int m){
		String n1=Integer.toString(n);
		String m1=Integer.toString(m);
		char[]n2=n1.toCharArray();
		char[]m2=m1.toCharArray();
		
		int[][]sum= new int[n1.length()+1][m1.length()+1];
		
		for(int i=1;i<=n1.length();i++){
			for(int j=1;j<=n1.length();j++){
				if(n2[i-1]==m2[j-1]){
					if(i-1>=0 || j-1>=0 )sum[i][j]=sum[i-1][j-1]+1;
					else sum[i][j]=1;
				}
				else sum[i][j]=0;
			}
		}
		
		
		for(int i=1;i<n1.length();i++){
			if(sum[n1.length()][i]>0){
				if(sum[n1.length()-i][n1.length()]==(n1.length()-sum[n1.length()][i])){
					
					return true;
				}
			}
		}
		return false;
	}
	
	
	public static void main(String[] args) {
		
		Recycle r = new Recycle("input3.txt");

	}

}
