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();
	}

}
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;


public class Numbers {
	
	public static void main(String args[])throws IOException{
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		String regex = " ";
		int T = Integer.parseInt(in.readLine());
		String str;
		String[] split;
		String[] result = new String[T+1];
		for(int x = 1; x <= T; x++){
			result[x] = "Case #" + x + ": ";
			str = in.readLine();
			split = str.split(regex);
			if(split.length < 2) {
				result[x] = result[x].concat("0");
			} else {
				result[x] = result[x].concat(Integer.toString(getNumberOfPairs(Integer.parseInt(split[0]), Integer.parseInt(split[1]))));
			}
		}
		for(int u = 1; u <= T; u++){
			System.out.println(result[u]);
		}
			
		
	}
	
	public static int getNumberOfPairs(int a, int b){
		int pairs = 0;
		for(int x = a; x < b; x++) {
			for(int y = b; y > x; y--) {
				if(isRecycledPair(x,y)){
					pairs++;
				}
			}
		}
		return pairs;
	}
	
	public static boolean isRecycledPair(int a, int b){
		boolean result = false;
		String A = Integer.toString(a);
		String B = Integer.toString(b);
		String tempA;
		if(A.length() != 1 && B.length() != 1){
			for(int x = 1; x < A.length();x++){
				tempA = A.substring(x, A.length());
				tempA = tempA.concat(A.substring(0, x));
				if(tempA.equals(B)){
					result = true;
				}
			}
		}
		return result;
		
	}

}
