import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.HashSet;
import java.util.Set;


public class GoogleC {
	public String szamol(String input){
		String result="";
		String a=input;
		Integer min=Integer.parseInt(a.substring(0,a.indexOf(' ')));
		a=a.substring(a.indexOf(' ')+1);
		Integer max=Integer.parseInt(a);
		Long count=0l;
		for(Integer i=min; i<=max; i++){
			String e1=i.toString();
			Set<Integer> db=new HashSet<Integer>(); 
			for (int j=1; j<e1.length();j++){
				
				String e2=e1.substring(j)+e1.substring(0,j);
				Integer k=Integer.parseInt(e2);
				if (k>i && k<=max){
					db.add(k);
					//System.out.println(e1+"\t"+e2);
				}
				
			}
			count+=db.size();
		}
		
		return count.toString();
	}
	public static void main(String[] args) {
		GoogleC a=new GoogleC();
		//String filename="input.txt";
		//String filename="C-small-attempt0.in";
		String filename="C-large.in";
		String thisLine;
		try {
			BufferedReader br = new BufferedReader(new FileReader(filename));
			BufferedWriter bw= new BufferedWriter(new FileWriter(filename+".out"));
			thisLine=br.readLine();
			Integer tnum=Integer.parseInt(thisLine);
		     for(int i=0;i<tnum;i++) { // while loop begins here
		    	 	thisLine=br.readLine();
		           System.out.println(thisLine);
		           System.out.println("Case #"+(i+1)+": "+a.szamol(thisLine)+"\n");
		           bw.write("Case #"+(i+1)+": "+a.szamol(thisLine)+"\n");
		         } // end while 
		        // end try
		     br.close();
		     bw.close();
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}


	}

}

import java.util.Scanner;


public class C {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int t = sc.nextInt();
        for (int i = 0; i < t; i++) {
            int a = sc.nextInt();
            int b = sc.nextInt();
            int count = 0;
            
            int digits = 0;
            int max = 1;
            int ac = a;
            while(ac > 0) {
                ac /= 10;
                digits++;
                max *= 10;
            }
            int min = max / 10;
            ac = a;
            
            for (int j = a; j < b; j++) {
                if (j == max) {
                    digits++;
                    max *= 10;
                    min *= 10;
                }
                count += getNumPair(j, b, digits, min);
            }
            System.out.println("Case #" + (i+1) + ": " + count);
            
        }
    }

    static final int[] temp = new int[10];
    
    private static int getNumPair(int i, int b, int digits, int min) {
        int ac = i;
        int numKouho = 0;
        int count = 0;
        ddd: for (int k = 0; k < digits - 1; k++) {
            i = i % min * 10 + i / min;
            if (ac < i && i <= b) {
                for (int j = 0; j < numKouho; j++) {
                    if (temp[j] == i) continue ddd;
                }
                temp[numKouho++] = i;
                count++;
            }
        }
        return count;
    }

}
