/*
 * 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.FileNotFoundException;
import java.util.Collections;
import java.util.LinkedList;
import java.util.Scanner;

public class CSmall {
	LinkedList<Integer>[]	map;

	public static void main(String[] args) throws FileNotFoundException {
		CSmall csmall = new CSmall();
		csmall.generateMap(1005);

		Scanner scanf = new Scanner(new File("CSmall_in.txt"));
		int T = scanf.nextInt();

		for (int t = 1; t <= T; t++) {
			int A = scanf.nextInt();
			int B = scanf.nextInt();
			System.out.println("Case #" + t + ": " + csmall.result(A, B));
		}
	}

	int result(	int a, int b) {
		int total = 0;
		for (int n = a; n <= b; n++) {
			int current = countBetween(n, a, b);
			total += current;
		}

		return total;
	}

	int countBetween(	int n, int low, int high) {
		LinkedList<Integer> list = map[n];

		int lowIndex = 0;
		for (; lowIndex < list.size() && list.get(lowIndex) < low; lowIndex++)
			;
		int highIndex = lowIndex;
		for (; highIndex < list.size() && list.get(highIndex) <= high; highIndex++)
			;

		return highIndex - lowIndex;
	}

	void generateMap(	int size) {
		map = new LinkedList[size + 1];

		for (int i = 0; i < map.length; i++) {
			map[i] = new LinkedList<Integer>();
		}

		for (int n = 1; n <= map.length; n++) {
			char[] charsInN = Integer.toString(n).toCharArray();

			for (int j = 0; j < charsInN.length; j++) {

				int rotation = rotateLeft(charsInN);

				if (rotation > size) {
					continue;
				}

				if (rotation < n) {
					map[rotation].add(n);
				}
			}
		}

		for (int i = 0; i < map.length; i++) {
			Collections.sort(map[i]);
		}
	}

	int rotateLeft(	char[] chars) {
		int l = chars.length - 1;
		char c = chars[0];
		for (int i = 0; i < l; chars[i] = chars[++i])
			;

		chars[l] = c;

		return Integer.parseInt(new String(chars));
	}
}
