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


public class Recycled {
	
	public static Integer reorder(int n) {
		int newn = n, digits = 0, greatest = 0, scale = 1;
		while (newn > 0) {
			newn /= 10;
			digits++;
			scale *= 10;
		}
		scale /= 10;
		int temp = 0;
		for (int i = 0; i < digits; i++) {
			temp = n;
			temp /= 10;
			temp += scale * (n-(10*temp));
			n = temp;
			greatest = Math.max(n,greatest);
		}
		
		return greatest;
	}
	
	public static void main(String[] args) {
		
		String fileName;
		String line;
		fileName = "C-small-attempt0.in";
		
		Scanner fromFile = null;
		try {
			fromFile = new Scanner(new File(fileName));
		} catch (Exception e) {}
		
		int iterations = Integer.parseInt(fromFile.nextLine());
		int count, lower, upper;
		int[] answers = new int[iterations];
		HashMap<Integer,Integer> map = null;
		Integer ordered = null;
		
		for (int i = 0; i < iterations; i++) {
			
			line = fromFile.nextLine();
			String[] arguments = line.split(" ");
			lower = Integer.parseInt(arguments[0]);
			upper = Integer.parseInt(arguments[1]);
			count = 0;
			map = new HashMap<Integer,Integer>();
			
			for (int j = lower; j <= upper; j++) {
				ordered = reorder(j);
				if (map.containsKey(ordered)) {
					int number = map.get(ordered);
					count += number;
					map.put(ordered, number+1);
				} else {
					map.put(ordered, 1);
				}
			}
			
			answers[i] = count;
		}
		
		try {
			fromFile.close();
		} catch (Exception e){}
		
		PrintWriter toFile = null;
		try {
			File f = new File("output.txt");
			if (!f.exists())
				f.createNewFile();
			toFile = new PrintWriter(f);
		
			for (int i = 0; i < iterations; i++) {
				if (i == iterations - 1) {
					toFile.print("Case #" + (i + 1) + ": " + answers[i]);
				} else {
					toFile.println("Case #" + (i + 1) + ": " + answers[i]);
				}
			}
			
			toFile.close();
		
		} catch (Exception e) {}
	}
}
