/*
 * 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.*;
import java.util.*;
import java.io.*;
import java.util.*;
import static java.lang.System.*;  

import java.util.Map;
import java.util.TreeMap;
import java.util.Collection;
import java.util.List;
import java.util.Arrays;
import java.util.Iterator;
public class goog {
        
 
    public static void main(String[] args) throws IOException {
   Scanner file = new Scanner(new File("C-small-attempt0.in."));
     PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("prob1.out")));
     int times = file.nextInt();
       file.nextLine();
       
       for(int i = 0;i<times;i++) {
       ArrayList<String> answers = new ArrayList<String>();
       out.print("Case #"+(i+1)+": ");
       int a =file.nextInt();
       int b= file.nextInt();
      
       int answer =0;
       int random =0;
       for(int d = a; d<b+1;d++) {
       	for(int e =d+1;e<b+1;e++) {
       		if(e<=9||d<=9) continue;
       		else if(answers.contains("" + d + e)) {
       		    // dont know what to do, randomly adddeed
       		    random++;
       		}
       		else {
       			//set string first number
       			String g = "" + d;
       			//set string to second number
       			String h = "" + e;
       			//set temp string to second thing
       			String change = h;
       				// rotate it to see if rotation verison works
       			h = h.substring(h.length()-1) + h.substring(0,h.length()-1);
       			while(!(h.equals(change))) {
       				// if rotated isnt the same
       				if(h.equals(g)) {
       					// if rotated is the same as the one
       					answer++;
       					answers.add("" + d + e);
       						   break;
       				}
       				// rotate it again
       				h = h.substring(h.length()-1) + h.substring(0,h.length()-1);
       			}
       			
       		}
       	}
       }
       out.println(answer);
       System.out.println(answer);
       }
      out.close();
      System.exit(0);
    }
}
