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.FileReader;
import java.io.FileWriter;
import java.util.StringTokenizer;

/**
 * @author MASTERMIND
 *
 */
public class Prog {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub

		FileReader fr;
		try 
		{
			fr = new FileReader("C-small-attempt0.in");
			FileWriter f1 = new FileWriter("C-small.out");
			
			BufferedReader br = new BufferedReader(fr);
			
			int i=1;
			String s;
			StringBuffer strbuf = new StringBuffer();
			
			br.readLine();
			while((s = br.readLine())!=null)
			{
				
				int count = 0; 
				strbuf.delete(0, strbuf.length());
				StringTokenizer st = new StringTokenizer(s," ");
				int no1 = Integer.parseInt(st.nextToken());
				System.out.print(no1+"\t");
				int no2 = Integer.parseInt(st.nextToken());
				System.out.println(no2);
				int current = no1;
				while(current < no2)
				{
					String s1 = String.valueOf(current);
																		
					for(int next=current+1 ; next<=no2 ; next++)
					{
						//System.out.println(current+"   "+next);
						String s2 = String.valueOf(next);
						for(int j=1;j<s2.length();j++)
						{
							String p1 = s2.substring(s2.length()-j, s2.length());
							String p2 = s2.substring(0, s2.length()-j);
							String cat = p1+p2;
							//System.out.println(p1+"   "+p2+"   "+cat+"   "+s1);
							if(cat.equals(s1))
								count++;
						}
					}
					
				current++;
				}
				
				strbuf.insert(0, "Case #"+i+": "+count+"\n");
				i++;
			
				char[] buffer = new char[strbuf.length()];
				s = strbuf.toString();
				System.out.println(s);
				s.getChars(0, s.length(), buffer, 0);
				
				f1.write(buffer);
			}
			f1.close();
			fr.close();
			
		} catch (Exception e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
	}

}
