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.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Hashtable;


public class MainJam2 {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		
		BufferedReader in = new BufferedReader(new FileReader("C:\\Jam\\teste.txt"));
		File file = new File("C:\\Jam\\saida.txt");
		FileWriter print = new FileWriter(file);
		
		int i = Integer.parseInt(in.readLine());
		
		int k = i;
		
		while(i > 0){
			
			ArrayList<String> list = new ArrayList<String>();
			
			int resp = 0;
			String integer [] = in.readLine().split(" ");
			
			int ini = Integer.parseInt(integer[0]);
			int end = Integer.parseInt(integer[1]);
			
			for(int j = ini; j <= end; j++){
				
				String reverse = ""+j;
				String ini_reverse = reverse;
				
					do{
						String ini_s = reverse.substring(0, 1);
						reverse = reverse.substring(1, reverse.length()) + ini_s;
								
						int int_reverse = Integer.parseInt(reverse);
						
						if(reverse.equals(ini_reverse))
							break;
						
						if(int_reverse <= end && int_reverse >= ini && !list.contains(reverse)){
							System.out.println((k - i + 1)+" : "+reverse + " " + j);
							list.add(""+j);
							resp++;
						}
						
					}
					while(!reverse.equals(ini_reverse));
				
			}
			
			print.write("Case #"+ (k - i + 1) +": "+resp+System.getProperty("line.separator"));
			
			i--;
		}
		print.close();


	}

}
