import java.util.HashMap;
import java.util.HashSet;
import java.util.Scanner;

public class Recycle {

	private static HashMap<Integer, HashSet<Integer>> map = new HashMap<Integer, HashSet<Integer>>();
	private static HashSet<Integer> toSkip = new HashSet<Integer>();
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner reader = new Scanner(System.in);
		int T = reader.nextInt();
		for (int tc = 1; tc <= T; tc++) {
			int a = reader.nextInt();
			int b = reader.nextInt();
			long before = System.currentTimeMillis();
			int res = doit(a, b);
			System.out.printf("Case #%d: %d\n", tc, res);
			long after = System.currentTimeMillis();
//			System.out.println("time taken: " + (after - before));
		}
	}

	private static int doit(int a, int b) {
		int count = 0;
		HashSet<Integer> skip = new HashSet<Integer>(toSkip);
		for (int i = a; i <= b; i++) {
			if (skip.contains(i))
				continue;
			HashSet<Integer> arr = generate(i);
//			if(arr.size() > 1) {
//				map.put(i, arr);
//			}
			// System.out.println(i + " --> " +
			// Arrays.deepToString(arr.toArray()));
			int temp = 0;
			if (arr.size() > 1) {
				for (int x : arr) {
					if (x >= a && x <= b) {
						temp++;
						skip.add(x);
					}
				}
				count += temp * (temp - 1) / 2;
			}
//			System.out.println("not skipping " + i + " gen: " + arr.size()+ " " + (temp * (temp - 1) / 2));
		}
		return count;
	}

	private static HashSet<Integer> generate(int num) {
		if(map.containsKey(num)) {
			HashSet<Integer> list = map.get(num);
			return list;
		}
		HashSet<Integer> list = new HashSet<Integer>();
		String s = "" + num;
		list.add(num);
		int len = s.length();
		for (int i = 1; i < len; i++) {
			String temp = s.substring(i) + s.substring(0, i);
			// System.out.println("temp: " + temp);
			if (temp.charAt(0) == '0')
				continue;
			int x = Integer.parseInt(temp);
			if( x <= 2000000) {
				list.add(x);
			}
		}
		if(list.size() > 1) {
			map.put(num, list);
		} else {
			toSkip.add(num);
		}
		return list;
	}

}

package utils;

/**
 *
 * @author Fabien Renaud
 */
public abstract class Jam implements Runnable, JamParser {

  protected final String[] lines;
  protected final JamCase[] cases;
  protected final int t;
  private final String filenameInput;
  private final String filenameOutput;
  private final String[] output;
  private final StopWatch timer;
  private int count;

  protected Jam(String filename) {
    this.filenameInput = filename;
    this.filenameOutput = filename.replace(".in", ".out");
    this.count = 0;
    this.lines = File.readAllLines(filenameInput);
    this.timer = new StopWatch();
    this.t = Integer.parseInt(lines[0]);
    this.cases = new JamCase[t];
    this.output = new String[t];
    File.delete(filenameOutput);
  }

  protected final synchronized void appendOutput(int number, String result) {
    output[number - 1] = String.format("Case #%1$d: %2$s", number, result);
    count++;
    if (count == t) {
      timer.stop();
      saveOutput();
    }
  }

  private void saveOutput() {
    if (count != t) {
      System.err.println(String.format("%1$d results are missing. File not saved."));
    } else {
      File.writeAllLines(filenameOutput, output);
      System.out.println("File saved at " + filenameOutput);
      System.out.println("---------- OUTPUT ----------");
      for (String s : output) {
        System.out.println(s);
      }
      System.out.println("--- Processed in " + timer.getElapsedSeconds() + " seconds.");
    }
  }

  @Override
  public final void run() {
    int j;
    count = 0;

    timer.start();
    for (int i = 1; i <= t; i++) {
      j = i - 1;
      cases[j] = getJamCase(i);
      if (cases[j] != null) {
        new Thread(cases[j]).start();
      }
    }
  }
}
