/*
 * Problem C. Recycled Numbers
 * 
 * Do you ever become frustrated with television because you keep seeing the
 * same things, recycled over and over again? Well I personally don't care about
 * television, but I do sometimes feel that way about numbers.
 * 
 * Let's say a pair of distinct positive integers (n, m) is recycled if you can
 * obtain m by moving some digits from the back of n to the front without
 * changing their order. For example, (12345, 34512) is a recycled pair since
 * you can obtain 34512 by moving 345 from the end of 12345 to the front. Note
 * that n and m must have the same number of digits in order to be a recycled
 * pair. Neither n nor m can have leading zeros.
 * 
 * Given integers A and B with the same number of digits and no leading zeros,
 * how many distinct recycled pairs (n, m) are there with A â¤ n < m â¤ B?
 * 
 * Input
 * 
 * The first line of the input gives the number of test cases, T. T test cases
 * follow. Each test case consists of a single line containing the integers A
 * and B.
 * 
 * Output
 * 
 * For each test case, output one line containing "Case #x: y", where x is the
 * case number (starting from 1), and y is the number of recycled pairs (n, m)
 * with A â¤ n < m â¤ B.
 * 
 * Limits
 * 
 * 1 â¤ T â¤ 50.
 * 
 * A and B have the same number of digits.

Small dataset

1 â¤ A â¤ B â¤ 1000.

Large dataset

1 â¤ A â¤ B â¤ 2000000.

Sample


Input 
 	
Output 
 
4
1 9
10 40
100 500
1111 2222
Case #1: 0
Case #2: 3
Case #3: 156
Case #4: 287
 */

package google.codejam.y2012.qualifications;

import google.codejam.commons.Utils;

import java.io.IOException;
import java.util.StringTokenizer;

/**
 * @author Marco Lackovic <marco.lackovic@gmail.com>
 * @version 1.0, Apr 14, 2012
 */
public class RecycledNumbers {

	private static final String INPUT_FILE_NAME = "C-large.in";
	private static final String OUTPUT_FILE_NAME = "C-large.out";

	public static void main(String[] args) throws IOException {
		String[] input = Utils.readFromFile(INPUT_FILE_NAME);
		String[] output = new String[input.length];
		int x = 0;
		for (String line : input) {
			StringTokenizer st = new StringTokenizer(line);
			int a = Integer.valueOf(st.nextToken());
			int b = Integer.valueOf(st.nextToken());
			System.out.println("Computing case #" + (x + 1));
			output[x++] = "Case #" + x + ": " + recycledNumbers(a, b);
		}
		Utils.writeToFile(output, OUTPUT_FILE_NAME);
	}

	private static int recycledNumbers(int a, int b) {
		int count = 0;
		for (int n = a; n < b; n++) {
			count += getNumGreaterRotations(n, b);
		}
		return count;
	}

	private static int getNumGreaterRotations(int n, int b) {
		int count = 0;
		char[] chars = Integer.toString(n).toCharArray();
		for (int i = 0; i < chars.length; i++) {
			chars = rotateRight(chars);
			if (chars[0] != '0') {
				int m = Integer.valueOf(new String(chars));
				if (n == m) {
					break;
				} else if (n < m && m <= b) {
					count++;
				}
			}
		}
		return count;
	}

	private static char[] rotateRight(char[] chars) {
		char last = chars[chars.length - 1];
		for (int i = chars.length - 2; i >= 0; i--) {
			chars[i + 1] = chars[i];
		}
		chars[0] = last;
		return chars;
	}

}

import java.io.File;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.InputStream;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

import com.ibm.db2.jcc.am.s;


public class C {
    private static final String INPUT_FILE = "d:/C-large(1).in";
    private static final String OUTPUT_FILE = "d:/result.out";
    private static final int MAX_VALUE = 2000000;
    private static int T;
    static int[] d = new int[1 + MAX_VALUE];
    static int a, b;
    static long[] result;
    
    static void init() {
        for (int i = 1; i <= MAX_VALUE; ++i) {
            if (d[i] != 0) {
                continue;
            }
            d[i] = i;
            String s = "" + i;
            for (int j = 0; j < s.length(); ++j) {
                s = s.substring(1) + s.charAt(0);
                if (s.charAt(0) != '0') {
                    int v = Integer.parseInt(s);
                    if (v > MAX_VALUE) continue;
                    d[Integer.parseInt(s)] = i;
                }
            }
        }
    }
    
    static void Input() throws Exception {
        InputStream in = new FileInputStream(INPUT_FILE);
//        InputStream in = System.in;
        Scanner scanner = new Scanner(in);
        T = scanner.nextInt();
        result = new long[T + 1];

        for (int i = 0; i < T; ++i) {
            a = scanner.nextInt();
            b = scanner.nextInt();
            solve(i, a, b);
        }
    }
    
    static void solve(int c, int a, int b) {
        long rst = 0;
        int[] map = new int[MAX_VALUE + 1];
        for (int i = a; i <= b; ++i) {
            ++map[d[i]];
        }
        for (int i = a; i <= b; ++i) {
            if (map[d[i]] > 0) {
                int v = map[d[i]];
                rst += 1L * v * (v - 1) / 2;
                map[d[i]] = 0;
            }
        }
        result[c] = rst;
    }
    
    static void Output() throws Exception {
        FileWriter writer = new FileWriter(new File(OUTPUT_FILE));
        for (int i = 0; i < T; ++i) {
            String rs = "Case #" + (i + 1) + ": " + (result[i]) + "\n";
            writer.write(rs);
            System.out.println(rs);
        }
        writer.close();
    }
    
    /**
     * @param args
     */
    public static void main(String[] args) throws Exception {
        long start = System.currentTimeMillis();
        init();
//        System.out.println(System.currentTimeMillis() - start);
        Input();
        Output();
    }
}
