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

public class RecycledNumbers
{
    public RecycledNumbers()
    {
        Scanner inFile = null;
        try
        {
            inFile = new Scanner(new File("input.txt"));
        }
        catch(Exception e)
        {
            System.out.println("Problem opening input file. Exiting...");
			System.exit(0);
        }
        int t = inFile.nextInt();
        
        int [] results = new int [t];
        RecycledNumbersCounter [] rnc = new RecycledNumbersCounter[t];
        
        int i;
        for(i = 0; i < t; i++)
        {
            rnc[i] = new RecycledNumbersCounter(i, inFile.nextInt(), inFile.nextInt(), results);
            rnc[i].start();
        }
        inFile.close();
        
        boolean done = false;
        
        while(!done)
        {
            done = true;
            for(i = 0; i < t; i++)
                if(rnc[i].isAlive())
                {
                    done = false;
                    break;
                }
        }
        
        PrintWriter outFile = null;
        try
        {
            outFile = new PrintWriter(new File("output.txt"));
        }
        catch(Exception e)
        {
            System.out.println("Problem opening output file. Exiting...");
			System.exit(0);
        }
        
        for(i = 0; i < results.length; i++)
            outFile.printf("Case #%d: %d\n", i+1, results[i]);
        outFile.close();
    }
    
    public static void main(String [] args)
    {
        new RecycledNumbers();
    }
    
    public static String intToString(int i)
    {
        String res = "";
        while(i > 0)
        {
            res =(i%10)+res;
            i /= 10;
        }
        
        return res;
    }
    
    private class RecycledNumbersCounter extends Thread
    {
        int id;
        int a, b;
        int [] results;
        
        public RecycledNumbersCounter(int i, int first, int second, int [] res)
        {
            id = i;
            a = first;
            b = second;
            results = res;
        }
        
        public void run()
        {
            int count = 0;
            for(int i = a; i < b; i++)
            {
                for(int j = i+1; j <= b; j++)
                    if(recycled(i, j))
                    {
                        count++;
                    }
            }
            results[id] = count;
        }
        
        public boolean recycled(int a, int b)
        {
            String c = intToString(a);
            String d = intToString(b);
            boolean found = false;
            
            if(c.length() != d.length())
                return false;
            
            int d_index = d.indexOf(c.charAt(0));
            
            while(d_index >= 0)
            {
                found = true;
                for(int i = 1; i < c.length(); i++)
                {
                    if(c.charAt(i) != d.charAt((d_index + i)%d.length()))
                    {
                        found = false;
                        break;
                    }
                }
                if(found)
                    return true;
                d_index = d.indexOf(c.charAt(0), d_index+1);
            }
            
            return false;
        }
    }
}