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

public class C {
	public static void main(String[] args) throws FileNotFoundException {
		Scanner scan = new Scanner(new File("C-small-attempt0.in"));
		System.setOut(new PrintStream("C-small-attempt0.out"));

		int t = scan.nextInt();
		for (int c = 0; c < t; c++) {
			int a = scan.nextInt();
			int b = scan.nextInt();
			int ans = 0;
			int[] bDigits = digits(b);

			for (int n = a; n < b; n++) {
				int[] nDigits = digits(n);
				int digitCount = nDigits.length;
				Set<Integer> done = new HashSet<Integer>();
				for (int i = 1; i < digitCount; i++) {
					int[] mDigits = rotate(nDigits, i);
					int m = normal(mDigits);
					if (isLess(nDigits, mDigits) && isLessEq(mDigits, bDigits)
					        && !done.contains(m)) {
						ans++;
						done.add(m);
						/*
						 * if (c == 3) { if (normal(nDigits) != n) throw new
						 * AssertionError(); System.out.println(n + " " + m); if
						 * (n < a || n >= m || m > b) throw new
						 * AssertionError(); }
						 */
					}
				}
			}

			System.out.printf("Case #%d: %d%n", c + 1, ans);
		}
	}

	private static int[] digits(int n) {
		int num = 0;
		int temp = n;
		while (temp > 0) {
			num++;
			temp /= 10;
		}

		int[] dig = new int[num];
		temp = n;
		for (int i = 0; i < num; i++) {
			dig[num - i - 1] = temp % 10;
			temp /= 10;
		}
		return dig;
	}

	private static int[] rotate(int[] num, int r) {
		int n = num.length;
		int[] ans = new int[n];
		for (int i = 0; i < r; i++) {
			ans[i] = num[n - r + i];
		}
		for (int i = 0; i < n - r; i++) {
			ans[r + i] = num[i];
		}
		return ans;
	}

	private static int normal(int[] num) {
		int base = 1;
		int ans = 0;
		for (int i = 0; i < num.length; i++) {
			ans += num[num.length - 1 - i] * base;
			base *= 10;
		}
		return ans;
	}

	private static boolean isLess(int[] a, int[] b) {
		for (int i = 0; i < a.length; i++) {
			if (a[i] < b[i])
				return true;
			if (a[i] > b[i])
				return false;
		}
		return false;
	}

	private static boolean isLessEq(int[] a, int[] b) {
		for (int i = 0; i < a.length; i++) {
			if (a[i] < b[i])
				return true;
			if (a[i] > b[i])
				return false;
		}
		return true;
	}
}