import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;

public class CopyOfCopyOfMain {

	static int ndigits(int n) {
		return (int) (Math.log10(n) + 1);
	}

	static int rot(int n, int dig) {
		return (int) ((n % 10) * Math.pow(10, dig - 1)) + (int) (n / 10);
	}

	public static void main(String[] args) throws FileNotFoundException {
		String file = "C-large";
		Scanner in = new Scanner(new File(file + ".in"));
		PrintWriter out = new PrintWriter(new File(file + ".out"));

		int T = in.nextInt();
		for (int t = 1; t <= T; t++) {
			int A = in.nextInt();
			int B = in.nextInt();

			int c = 0;
			int[] list = new int[ndigits(B)];
			numbers: for (int i = A; i <= B; i++) {
				int digs = ndigits(i);
				int rot = i;
				int pairs = 0;

				Arrays.fill(list, -1);
				list[0] = i;

				digits: for (int j = 1; j <= digs + 1; j++) {

					rot = rot(rot, digs);
					if(rot < i)
						continue;

					if (A <= rot && rot <= B) {
						for (int k = 0; k < j; k++) {
							if (list[k] == rot) {
								continue digits;
							}
						}
						pairs++;
						list[j] = rot;
					}
				}

				//c += pairs * (pairs + 1) / 2;
				c += pairs ;
				// c+=digs;
			}
			out.println("Case #" + t + ": " + c);
		}

		in.close();
		out.close();
	}
}


package Qualification;
import Practice.*;
import java.util.*;
import java.io.*;

public class C {
    
    public void ejecutar() throws Exception {
        Scanner sc = new Scanner(new FileReader("/home/gomezluisj/Descargas/C-large.in"));
	PrintWriter pw = new PrintWriter(new FileWriter("/home/gomezluisj/Descargas/C.out"));
	int caseCnt = sc.nextInt();
        for (int caseNum = 0; caseNum < caseCnt; caseNum++) {
            pw.print("Case #" + (caseNum + 1) + ": ");
            int ini=sc.nextInt();
            int fin=sc.nextInt();
            int res=0;
            for (int i = ini; i < fin; i++) {
                String number=Integer.toString(i);
                List<Integer> lista=new ArrayList<Integer>();
                for (int j = 1; j < number.length(); j++) {
                    String compare=number.substring(j)+number.substring(0, j);
                    
                    int num=Integer.parseInt(compare);
                    if(num>i&&num<=fin){
                        Iterator iter=lista.iterator();
                        int flag=0;
                        while(iter.hasNext()){
                            if((Integer)iter.next()==num){
                                flag=1;
                            }
                        }
                        if (flag==0){
                            res=res+1;
                            lista.add(num);
                        }
                        
//                        System.out.println(""+i+" "+num);
                    }
                }
            }
            pw.println(res);
        }	
        pw.flush();
        pw.close();
        sc.close();
    }
    
    
    public static void main(String[] args) throws Exception {
		new C().ejecutar();
	}
}
