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 org.weiwei.recyclenumber;

import java.util.Date;
import java.util.HashSet;
import java.util.Set;

/**
 * Created with IntelliJ IDEA.
 * User: ding
 * Date: 12-4-14
 * Time: ä¸å1:03
 * To change this template use File | Settings | File Templates.
 */
public class RecyleBin {
    int lower;
    int higher;
    Set<Integer> retSet = new HashSet<Integer>();
    int length;
    int lengthNumber;

    public RecyleBin(int lower, int higher) {
        this.lower = lower;
        this.higher = higher;
        this.length = String.valueOf(lower).length();
        this.lengthNumber = (int)Math.pow(10, length-1);
    }

    public int exhaust(int i){
        int ret = 0;
        retSet.clear();
        if(length ==1 )
            return 0;
        else{
            int temp = i;
            for(int j = 1; j < length; j++){
                temp = temp/10+temp%10*lengthNumber;
                if(temp >= (10^length)  && temp < i && temp >= lower && !retSet.contains(temp)){
                    ret++;
                    retSet.add(temp);
                }
            }
        }
        return ret;
    }

    public int exhaust(){
        System.out.println(new Date(System.currentTimeMillis()));
        int ret = 0;
        for(int i = higher; i >= lower; i--){
            ret+=exhaust(i);
        }
        System.out.println(new Date(System.currentTimeMillis()));
        return ret;
    }

    public static void main(String[] args) {
        RecyleBin bin = new RecyleBin(1111, 2222);
        System.out.println(bin.exhaust());
    }
}
