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.util.Scanner;


public class Recycle {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		int cases = Integer.parseInt(sc.nextLine());
		
		for(int i = 0; i < cases; i++) {
			Scanner line = new Scanner(sc.nextLine());
			int A = line.nextInt();
			int B = line.nextInt();			
			
			int k = Integer.toString(A).length();
			
			int fac = (int) (Math.pow(10, k-1));
			
			IntSet set = new IntSet(k);
			
			int pairCount = 0;
			for(int n = A; n < B; n++) {
				set.clear();
				int m = n;
				for(int j = 0; j < k-1; j++) {
					int mod = m % 10;
					m = m / 10;
					m = m + (fac * mod);
					if(m <= B && m > n) {
						//if not already there
						if(!set.insert(m)) {
							pairCount++;
						}
					}
				}
			}
			System.out.printf("Case #%d: %d\n", i+1, pairCount);
		}

	}
	

}

class IntSet {
	
	int[] ints;
	int ctr = 0;
	
	public IntSet(int k) {
		ints = new int[k];
		ctr = 0;
	}
	
	public boolean contains(int x) {
		for(int i = 0; i < ctr; i++) {
			if(ints[i] == x) {
				return true;
			}
		}
		return false;
	}
	
	//true if x already contained
	public boolean insert(int x) {
		if(contains(x)) {
			return true;
		}
		ints[ctr] = x;
		ctr++;
		return false;
	}
	
	public void clear() {
		ctr = 0;
	}
}