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


public class Recycle {
	
	int low, high;
	ArrayList<NumPair> instances;
	
	public Recycle(int low, int high) {
		this.low = low;
		this.high = high;
		this.instances = new ArrayList<NumPair>();
	}
	
	public void reset(int low, int high) {
		this.low = low;
		this.high = high;
		this.instances.clear();
	}
	
	NumPair moveDigits(int num, int digits) {
		String numStr = Integer.toString(num);
		int startIndex = numStr.length() - digits;
		String sub = numStr.substring(startIndex);
		String ret = sub.concat(numStr.substring(0,startIndex));	
		return new NumPair(num, Integer.parseInt(ret));
	}
	
	boolean checkRecycled(NumPair num) {
		if (num.orig == num.modded || num.modded > num.orig)
			return false;
		if (num.modded >= low && num.modded <= high) {
			return true;
		} 
		return false;
	}
	
	public void compute() {
		int length = Integer.toString(low).length();
		for (int i=low; i<=high; i++) {
			for (int j=1; j<length; j++) {
				NumPair shifted = moveDigits(i, j);
				if (checkRecycled(shifted)) {
					if (!instances.contains(shifted)) {
						instances.add(shifted);
					}
				}
			}
		}
	}
	
	public int getLow() {
		return low;
	}
	
	public int getInstances() {
		return instances.size();
	}

	public void setLow(int low) {
		this.low = low;
	}

	public int getHigh() {
		return high;
	}

	public void setHigh(int high) {
		this.high = high;
	}

	public static void main(String[] args) {
		File input = new File("C-small-attempt0.in");
		Recycle driver = new Recycle(1111,2222);
		if (!input.canRead())
			System.out.println("Can't read file!");
		int count=1;
		BufferedReader reader;
		try {
			reader = new BufferedReader(new FileReader(input));
			String line = reader.readLine();
			while ((line = reader.readLine()) != null && !line.isEmpty()) {
				StringTokenizer tokenizer = new StringTokenizer(line, " ");
				String low = tokenizer.nextToken();
				String high = tokenizer.nextToken();
				driver.reset(Integer.parseInt(low), Integer.parseInt(high));
				driver.compute();
				System.out.println("Case #" + count +": " + driver.getInstances());
				count++;
			}
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (IOException e) {
			e.printStackTrace();
		}
	}
	
	public class NumPair {
		int orig, modded;
		
		public NumPair(int orig, int modded) {
			this.orig = orig;
			this.modded = modded;
		}
		
		@Override public boolean equals(Object o) {
			NumPair n = (NumPair)o;
			if ((n.orig == orig && n.modded == modded) || (n.orig == modded && n.modded == orig)) {
				return true;
			}  
				return false;
		}
		
		public String toString() {
			return orig + ", " + modded;
		}
	}
	
}
