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();
	}

}
package com.blah;

import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.util.StringTokenizer;
import java.util.TreeMap;
import java.util.TreeSet;

public class MainProblem2 {

	static String english = "our language is impossible to understandthere are twenty six factorial possibilitiesso it is okay if you want to just give up",
			grese = "ejp mysljylc kd kxveddknmc re jsicpdrysirbcpc ypc rtcsra dkh wyfrepkym veddknkmkrkcdde kr kd eoya kw aej tysr re ujdr lkgc jv";

	static TreeMap<Character, Character> gToE = new TreeMap<Character, Character>();
	
	static String shiftToFront(String digits,int by){
		String toReturn = digits.substring(digits.length()-by).concat(digits.substring(0,digits.length()-by)); 
		return toReturn;
	}

	public static void main(String[] args) {

		try {
			BufferedReader br = new BufferedReader(new FileReader(args[0]));
			int numCases = Integer.parseInt(br.readLine());
			int cases[][] = new int[numCases][2];
			int response[] = new int[numCases];
			StringTokenizer st;
			for (int i = 0; i < numCases; i++) {
				st = new StringTokenizer(br.readLine());
				cases[i][0] = Integer.parseInt(st.nextToken()); 
				cases[i][1] = Integer.parseInt(st.nextToken());
			}
			String daCase;
			int shifted;
			TreeSet<String> recycled;
			for (int i = 0; i < numCases; i++) {
				recycled = new TreeSet<String>();
				for (int caseNumber = cases[i][0]; caseNumber <= cases[i][1]; caseNumber++) {
					daCase = ""+caseNumber;
					//System.out.println("Testing integer "+daCase);
					for (int k = 1; k < daCase.length(); k++) {
						shifted = Integer.parseInt(shiftToFront(daCase, daCase.length()-k));
						if(shifted<=cases[i][1] &&  shifted>caseNumber){
							recycled.add(""+caseNumber+""+shifted);
						}
					}
				}
				System.out.println("Case #"+(i+1)+": "+recycled.size());
			}
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (NumberFormatException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
		
		
		
		
		
		
	}

}