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.*;
import java.util.*;

public class Pairing{

	public static void main(String args[]){
		try
		{
  			FileInputStream fstream = new FileInputStream("textfile.txt");
			DataInputStream in = new DataInputStream(fstream);
			BufferedReader br = new BufferedReader(new InputStreamReader(in));
			FileWriter ffstream = new FileWriter("./output.txt");
		  	BufferedWriter out = new BufferedWriter(ffstream);
			String strLine,result;
			int i=0;
			strLine = br.readLine();
			i=Integer.parseInt(strLine);
			String startS, endS;
			int j=1;
			int val=0;
			int start=0,end=0,tt=0;
			int count=0;
			PairList lista;
			Pair res;
			while (j<=i)   {
				lista = new PairList();
				count=0;
				strLine = br.readLine();
				StringTokenizer token = new StringTokenizer(strLine);
				startS = token.nextToken();

	
				start=Integer.parseInt(startS);
				endS = token.nextToken();
			
	
				end=Integer.parseInt(endS);

				char[] startA = startS.toCharArray();
				char[] endA = endS.toCharArray();
				char[] temp = new char[endA.length];
				char[] newn = new char[endA.length];
				int curr=start;
				boolean adding=false;
				if(startA.length==endA.length && startA.length>1){
					int stop=start+(end-start)/2+1;
					while(curr<=end){
						curr++;

						temp = Integer.toString(curr).toCharArray();
						int k=temp.length-1;
						while(k>0){

							if(temp[k]<=endA[0] && temp[k]>=startA[0]){
								int l = k;
								int m=0;
								while(l<=temp.length-1){
									newn[m]=temp[l];
									l++;
									m++;

								}
								l = 0;
								while (m<temp.length){
									newn[m]=temp[l];
									l++;
									m++;
								}		
								result = new String(newn);
								res = new Pair();
								tt = Integer.parseInt(result);

								if(tt<curr && curr<=end && tt>=start){
									res.first=tt;
									res.second=curr;
									adding = true;
								}
								else if(tt>curr && tt<=end && curr>=start){ 
									res.first=curr;
									res.second=tt;
									adding=true;
								}
								else adding=false;
								
								
								if(adding==true ){
									int place = lista.Find(res,end);
									if(place<end){
										count++;
										lista.addP(place,res);
									}
								}
							}
							k--;
						}
					}
					
					
				}

				out.write("Case #"+Integer.toString(j)+": "+Integer.toString(count)+"\n");
				j++;
			}
			
			in.close();
			out.close();
		}
		catch (Exception e){//Catch exception if any
			e.printStackTrace();
		}
	}

}

