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

public class Main {
	public Scanner sc;
	public Map<Character, Character> mapping = new HashMap<Character, Character>();

	public static void main(String[] args) {
		Main m = new Main();
		m.start();
	}

	public void start() {
		sc = new Scanner(System.in);
		int t = sc.nextInt();
		for (int i = 1; i <= t; i++) {
			System.out.print("Case #" + i + ": ");
			solve();
		}
	}

	public void solve() {
		int a = sc.nextInt();
		int b = sc.nextInt();
		int ans = 0;
		Set<String> checked = new HashSet<String>();

		for (int n = a; n <= b; n++) {
			if (n < 10 || n == 1000) {
				continue;
			}

			char[] charArr = Integer.toString(n).toCharArray();

			if (charArr.length == 2) {
				if (charArr[1] != '0') {
					char[] newChar = { charArr[1], charArr[0] };
					int newInt = Integer.valueOf(String.valueOf(newChar));
					if (!checked.contains(n + " " + newInt) && n < newInt && newInt >= a && newInt <= b) {
						checked.add(n + " " + newInt);
						ans++;
					}
				}
			} else if (charArr.length == 3) {
//				if (charArr[0] != '0') {
//					char[] newChar1 = { charArr[0], charArr[2], charArr[1] };
//					int newInt = Integer.valueOf(String.valueOf(newChar1));
//					if (!checked.contains(n + " " + newInt) && n < newInt && newInt >= a && newInt <= b) {
//						checked.add(n + " " + newInt);
//						ans++;
//					}
//				}
				if (charArr[1] != '0') {
//					char[] newChar2 = { charArr[1], charArr[0], charArr[2] };
//					int newInt = Integer.valueOf(String.valueOf(newChar2));
//					if (!checked.contains(n + " " + newInt) && n < newInt && newInt >= a && newInt <= b) {
//						checked.add(n + " " + newInt);
//						ans++;
//					}
					char[] newChar3 = { charArr[1], charArr[2], charArr[0] };
					int newInt = Integer.valueOf(String.valueOf(newChar3));
					if (!checked.contains(n + " " + newInt) && n < newInt && newInt >= a && newInt <= b) {
						checked.add(n + " " + newInt);
						ans++;
					}
				}
				if (charArr[2] != '0') {
					char[] newChar4 = { charArr[2], charArr[0], charArr[1] };
					int newInt = Integer.valueOf(String.valueOf(newChar4));
					if (!checked.contains(n + " " + newInt) && n < newInt && newInt >= a && newInt <= b) {
						checked.add(n + " " + newInt);
						ans++;
					}
//					char[] newChar5 = { charArr[2], charArr[1], charArr[0] };
//					newInt = Integer.valueOf(String.valueOf(newChar5));
//					if (!checked.contains(n + " " + newInt) && n < newInt && newInt >= a && newInt <= b) {
//						checked.add(n + " " + newInt);
//						ans++;
//					}
				}
			}
		}
		System.out.println(ans);
//		for (String string : checked) {
//			System.out.println(string);
//		}
//		System.out.println(checked.size());
	}
}
