/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

package Happy;
import java.io.*;
import java.math.*;
import java.lang.*;
import java.util.*;
import java.util.Arrays.*;
import java.io.BufferedReader;
//import java.io.IOException;
//import java.io.InputStreamReader;
//import java.io.PrintWriter;
//import java.util.StringTokenizer;

/**
 *
 * @author ipoqi
 */
public class Happy {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        new Happy().haha();
    }

    public void haha() {
        BufferedReader in = null;
        BufferedWriter out = null;
        try{
            in = new BufferedReader(new FileReader("C-large.in"));
            out = new BufferedWriter(new FileWriter("LLL.out"));
            int T = Integer.parseInt(in.readLine());
            System.out.println("T="+T);

            //LinkedList<Integer> mm = new LinkedList<Integer>();
            //mm.add(new LinkedList<Integer>());
           //int[][] mm;
           //for(int ii=0;ii<mm.length;ii++){
           //     mm[0][ii] = 1;
           //}


            for(int i=0;i<T;i++){
                String[] line = in.readLine().split(" ");
                int A = Integer.parseInt(line[0]);
                int B = Integer.parseInt(line[1]);
                //System.out.print(" A = "+A+"\n");
                //System.out.print(" B = "+B+"\n");

                int ans = 0;

                
                for(int j=A;j<B;j++){
                    int n=j;
                    if(n>=10){
                        String N = Integer.toString(n);
                        int nlen = N.length();
                        List<Integer> oks = new ArrayList<Integer>();
                        for(int k=0;k<nlen-1;k++){
                            String M = "";
                            for(int kk=1;kk<=nlen;kk++){
                                 M = M + N.charAt((k+kk)%nlen);
                            }
                            int m = Integer.parseInt(M);
                            //System.out.print(" N = "+N+"\n");
                            //System.out.print(" M = "+M+"\n");

                            if(m>n && m<=B) {
                                boolean isNewOne = true;
                                for(int kkk=0;kkk<oks.size();kkk++){
                                    //System.out.print(" KKK = "+oks.get(kkk)+"\n");
                                    if(m==oks.get(kkk)){
                                        isNewOne = false;
                                    }
                                }
                                if(isNewOne){
                                    //System.out.print(" N = "+N+"\n");
                                    //System.out.print(" M = "+M+"\n");
                                    oks.add(m);
                                    ans++;
                                }
                            }
                        }
                    }
                }
                out.write("Case #"+(i+1)+": "+ans+"\n");
                System.out.print("Case #"+(i+1)+": "+ans+"\n");
            }
            in.close();
            out.close();
        }catch(Exception e){
            e.printStackTrace();
            try{
                in.close();
                out.close();
            }catch(Exception e1){
                e1.printStackTrace();
            }
        }
        System.out.print("YES!\n");
    }

}
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Collections;
import java.util.HashSet;
import java.util.Scanner;

public class C {
	static long[] ten;

	public static void main(String[] args) throws IOException {
		initializeTens();

		Scanner in = new Scanner(new FileReader("input.in"));
		BufferedWriter bw = new BufferedWriter(new FileWriter("output"));

		int T = in.nextInt(), start, end;
		for (int i = 1; i <= T; i++) {
			start = in.nextInt(); end = in.nextInt();
			int ans = cntPairs(start, end);
			bw.write("Case #" + i + ": " + ans);
			bw.newLine();
		}

		bw.close();
		System.out.println("end");
	}

	private static int cntPairs(int start, int end) {
		boolean[] v = new boolean[end+1];
		
		int cnt = 0;
		for(int i = start; i <= end; i++)
			if(!v[i])
				cnt += getPairs(i, start, end, v);
		
		return cnt;
	}

	private static int getPairs(int n, int start, int end, boolean[] v) {
		HashSet<Integer> set = new HashSet<Integer>();
		
		int len = getLength(n), cnt = 0;
		v[n] = true;
		
		for (int i = 1; i < len; i++) {
			long num = n * ten[i];
			num = num + n / ten[len - i];
			num = num % ten[len];

			int res = (int) num;
			if (res >= start && res <= end && len == getLength(res) && !v[res] && !set.contains(res)){
				set.add(res);
				cnt++;
			}
		}
		return cnt;
	}

	public static int getLength(int n) {
		return (int) (Math.log10(n) + 1e-6) + 1;
	}

	private static void initializeTens() {
		ten = new long[8];
		ten[1] = 10;
		for (int i = 2; i < ten.length; i++)
			ten[i] = 10 * ten[i - 1];
	}
}

/*
Case #1: 2498449

 *
 */

/*
Case #1: 615
Case #2: 0
Case #3: 680
Case #4: 732
Case #5: 622
Case #6: 536
Case #7: 0
Case #8: 721
Case #9: 719
Case #10: 0
Case #11: 730
Case #12: 560
Case #13: 590
Case #14: 742
Case #15: 596
Case #16: 738
Case #17: 604
Case #18: 662
Case #19: 670
Case #20: 6
Case #21: 614
Case #22: 640
Case #23: 684
Case #24: 757
Case #25: 608
Case #26: 697
Case #27: 780
Case #28: 646
Case #29: 776
Case #30: 199
Case #31: 624
Case #32: 602
Case #33: 748
Case #34: 728
Case #35: 6
Case #36: 628
Case #37: 718
Case #38: 634
Case #39: 674
Case #40: 609
Case #41: 0
Case #42: 695
Case #43: 637
Case #44: 0
Case #45: 744
Case #46: 1
Case #47: 36
Case #48: 801
Case #49: 192
Case #50: 724
*/