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 {
	public static void main(String args[])
	{		
		int t;
		int save[] = new int[50];
		Scanner kb = new Scanner(System.in);
		t = kb.nextInt();
		int a,b;
		for(int i=0;i<t;i++)
		{
			a = kb.nextInt();
			b = kb.nextInt();
			int change = 0;
			int count = 0;
			System.out.print("Case #"+(i+1)+": ");
			
			for(int j=a;j<=b;j++)
			{
				
				String s = Integer.toString(j); 
				int x=0;
				for(int start=1;start<s.length();start++)
				{
					int max=0;
					change = 0;
					for(int k=start-1;max<s.length();max++,k--)
					{
						if(k<0) k = s.length()-1;
						change = change + (s.charAt(k)-'0')*((int)Math.pow(10,max));
						if(max==s.length()-1)
						{
							save[x++] = change;
						}
						
					}
					if(change<=b && change>=a && change!=j && change>j) 
					{
						int point=0;
						for(int y=0;y<x-1;y++)
						{
							if(save[y]==change) 
							{
								point=1;
								break;
							}
						}
						if(point==0)
						{	
							count++;
						}
					}
				}
			}
			System.out.println(count);
		}
		
	}
}
