import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.ArrayList;
import java.util.Iterator;
import java.util.List;

public class Q3M {
	public static void main(String[] args) throws Exception {
		compute();
	}

	private static void compute() throws Exception {
		BufferedReader br = new BufferedReader(new FileReader(new File(
				"C:\\work\\Q3\\C-small-attempt0.in")));
		String line = null;
		int i = Integer.parseInt(br.readLine());
		List l = new ArrayList();
		for (int j = 0; j < i; j++) {
			line = br.readLine();
			String[] nums = line.split(" ");
			l.add(calculate(nums));
		}
		writeOutput(l);
	}

	private static int calculate(String[] nums) {
		int min = Integer.parseInt(nums[0]);
		int max = Integer.parseInt(nums[1]);
		int count = 0;
		List l = new ArrayList();
		for (int i = min; i <= max; i++) {
			for (int times = 1; times < countDigits(i); times++) {
				int res = shiftNum(i, times);
				if (res <= max && i < res) {
					if ((!l.contains((i + ":" + res)))) {
						l.add(i + ":" + res);
						l.add(res + ":" + i);
						count++;
					}
				}
			}
		}
		return count;
	}

	private static boolean checkZeros(int temp, int res) {
		if (temp % 10 == 0 || res % 10 == 0)
			return false;
		return true;
	}

	private static int shiftNum(int n, int times) {
		int base = (int) Math.pow(10, times);
		int temp2 = n / base;
		int placeHolder = (int) Math.pow((double) 10,
				(double) countDigits(temp2));
		int res = placeHolder * (n % base) + temp2;
		if (countDigits(res) == countDigits(n)) {
			return res;
		} else {
			return 2000001;
		}
	}

	public static int countDigits(int x) {
		if (x < 10)
			return 1;
		else {
			return 1 + countDigits(x / 10);
		}
	}

	private static void writeOutput(List l) throws Exception {
		StringBuffer b = new StringBuffer();
		int i = 1;
		BufferedWriter br = new BufferedWriter(new FileWriter(new File(
				"C:\\work\\Q3\\ans.txt")));
		for (Iterator iterator = l.iterator(); iterator.hasNext();) {
			br.write("Case #" + i++ + ": " + iterator.next());
			br.newLine();
		}
		br.close();
	}

}
/*
 * Copyright 2012 Bill Bejeck
 *
 *    Licensed under the Apache License, Version 2.0 (the "License");
 *    you may not use this file except in compliance with the License.
 *    You may obtain a copy of the License at
 *
 *        http://www.apache.org/licenses/LICENSE-2.0
 *
 *    Unless required by applicable law or agreed to in writing, software
 *    distributed under the License is distributed on an "AS IS" BASIS,
 *    WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 *    See the License for the specific language governing permissions and
 *    limitations under the License.
 */

package comp;

import java.io.*;

/**
 * User: Bill Bejeck
 * Date: 4/13/12
 * Time: 9:36 PM
 */
public class Recycled {
    public static void main(String[] args) throws Exception {
        BufferedReader reader = new BufferedReader(new InputStreamReader(new FileInputStream(args[0])));
        PrintWriter writer = new PrintWriter(new BufferedWriter(new FileWriter(new File(args[1]))));
        int numCases = Integer.parseInt(reader.readLine());
        for (int i = 0; i < numCases; i++) {
            String[] pair = reader.readLine().split(" ");
            int numberOne = Integer.parseInt(pair[0]);
            int numberTwo = Integer.parseInt(pair[1]);
            int count = getRecycled(numberOne, numberTwo);
            String result = String.format("Case #%d: %d", (i + 1), count);
            System.out.println(result);
            writer.println(result);
        }
        writer.flush();
        writer.close();
        reader.close();


    }

    private static int getRecycled(int n, int max) {
        int recycleCount = 0;
        for (int i = 0; i < max; i++) {
            String nSt = Integer.toString(n);
            int newMax = (n + 1);
            for (int k = 0; k < max && newMax <= max; k++) {
                String maxString = Integer.toString(newMax);
                for (int j = nSt.length() - 1; j >= 0; j--) {
                    String end = nSt.substring(j);
                    String start = nSt.substring(0, nSt.indexOf(end, j));
                    if (maxString.startsWith(end) && maxString.endsWith(start)) {
                        if (maxString.equals(end + start)) {
                            recycleCount++;
                        }
                    }

                }
                newMax++;
            }
            n++;
        }
        return recycleCount;
    }
}
