/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package recyclednumbers;

import java.util.HashSet;

/**
 *
 * @author vandit
 */
public class RecycleNumbers {

    private HashSet<String> numbers = new HashSet<String>();
    private HashSet<String> initialTempNumbers = new HashSet<String>();
    private HashSet<String> finalTempNumbers = new HashSet<String>();

    HashSet<Pair> numberPairs = new HashSet<Pair>();


    private void findRecycledNumbers(int start, int end, int places) {


        for (int i = start; i <= end; i++) {
            String initialNumber = Integer.toString(i);
            //if (!(numbers.contains(initialNumber) || finalTempNumbers.contains(initialNumber))) {

                StringBuffer tempNumber = new StringBuffer(initialNumber);
                int len = tempNumber.length();
                int startIndexToMove = len - places;
                String tempString = tempNumber.substring(startIndexToMove);
                if ((places == 1 && tempString.equals("0")) || tempString.charAt(0) == '0') {
                    continue;
                }
                tempNumber.delete(startIndexToMove, len);
                String finalTempNumber = tempString + tempNumber.toString();

                if (! (finalTempNumber.equals(initialNumber) || Integer.parseInt(finalTempNumber) > end || Integer.parseInt(finalTempNumber) < Integer.parseInt(initialNumber))) {
                    numbers.add(initialNumber);
                    finalTempNumbers.add(finalTempNumber);
                    Pair pair = new Pair(finalTempNumber,initialNumber);
                    numberPairs.add(pair);
                }
            }

        

    }

    public HashSet<Pair> findAllRecycledNumbers(int start, int end) {
        int length = Integer.toString(start).length();
        for (int i = 1; i < length; i++) {
            findRecycledNumbers(start, end, i);
        }
        return numberPairs;
    }
}

package com.gnooo;

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

public class Solution {
	static final boolean DBG = false;

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int T = sc.nextInt();

		long dStart = System.currentTimeMillis();

		StringBuilder sb = new StringBuilder();
		for (int i = 1; i <= T; i++) {
			OneTask task = new OneTask(sc.nextInt(), sc.nextInt());
			long res = task.getSolution();
			sb.append("Case #");
			sb.append(i);
			sb.append(": ");
			sb.append(res);
			sb.append('\n');
		}

		if (DBG) {
			sb.append("time :");
			sb.append(System.currentTimeMillis() - dStart);
		}
		System.out.print(sb.toString());

	}

	static class OneTask {
		long a, b;

		public OneTask(long a, long b) {
			this.a = a;
			this.b = b;
		}

		long getSolution() {
			long c = 0;

			for (long i = a; i < b; i++) {
				c += numberHasRecycledPairs(a, b, i);
			}
			return c;
		}

	}

	static long numberHasRecycledPairs(long min, long max, long no) {
		String str = String.valueOf(no);

		final int len = str.length();
		int res = 0;
		HashMap<Long, Integer> map = new HashMap<Long, Integer>();
		for (int i = 1; i < len; i++) {
			long tmp = Long.parseLong(str.substring(len - i)
					+ str.substring(0, len - i));
			if (min <= tmp && tmp <= max && tmp > no) {
				if (!map.containsKey(tmp)) {
					res++;
					map.put(tmp, 0);
				}
			}
		}

		return res;
	}
}
