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 round1;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Collection;
import java.util.HashSet;
import java.util.Set;

public class RecycledNumbers {
    public static Set<Integer>findRecycledNumbersBetween(int number, int start, int end) {
        if (number < 12) {
            return new HashSet<Integer>();
        }
        String num = "" + number;
        
        Set<Integer> nums = new HashSet<Integer>();
        for (int i = 1; i < num.length(); i++) {
            String firstPart = num.substring(0, i);            
            String lastPart = num.substring(i);
            if (lastPart.charAt(0) == '0') {
                continue;
            }
            
            int candidate = Integer.parseInt(lastPart + firstPart);
            if (candidate > number && (candidate >= start && candidate <= end)) {
                nums.add(candidate);
            }
        }
        
        return nums;
    }
    
    public static int findRecycledNumbersBetween(int start, int end) {
        int numbers = 0;
        for (int i = start; i <= end; i++) {
            Collection<Integer> recycles = findRecycledNumbersBetween(i, start, end);
            if (recycles.size() > 0) {
                //System.out.printf("found following recycles for %d => %s\n", i, recycles.toString());
            }
            numbers += recycles.size();
        }
        return numbers;
    }
    
    public static void findRecycledNumbersInFile(File input) throws IOException {
        InputStreamReader reader = new InputStreamReader(new FileInputStream(input));
        BufferedReader br = new BufferedReader(reader);
        int numLines = Integer.parseInt(br.readLine());
        for (int i = 1; i <= numLines; i++) {
            String line = br.readLine();
            String[] parts = line.split(" ");
            int start = Integer.parseInt(parts[0]);
            int end = Integer.parseInt(parts[1]);
            
            System.out.printf("Case #%d: %d\n", i, findRecycledNumbersBetween(start, end));
        }
    }

    /**
     * @param args
     */
    public static void main(String[] args) throws Exception {
        if (args.length != 1) {
            System.err.println("Usage: RecycledNumbers <InputFile>");
            System.exit(-1);
        }
        findRecycledNumbersInFile(new File(args[0]));
    }
}