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 cl.rodrigo;

import java.io.BufferedReader;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.AbstractList;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
import java.lang.StringBuffer;

public class RecycledNumbers {

	/**
	 * @param args
	 * @throws IOException 
	 * @throws NumberFormatException 
	 */
	public static void main(String[] args) throws NumberFormatException, IOException {
		FileInputStream fstream;
		
		int count;
		try {
			fstream = new FileInputStream("/home/rodrigo/Descargas/C-small-attempt0.in");
			DataInputStream in = new DataInputStream(fstream);
			BufferedReader br = new BufferedReader(new InputStreamReader(in));
			String strLine;
			
			count = Integer.parseInt(br.readLine());
			
			
			FileWriter outFile = new FileWriter("/home/rodrigo/GoogleCodeJam/C-small.out");
            PrintWriter out = new PrintWriter(outFile);
			
			for (int z=1;z<=count;z++) {
				HashMap hm = new HashMap();
				Integer contador = 0;
				String[] linea = br.readLine().split(" ");
				String lineakeypad = new String();
				
				Integer min = Integer.parseInt(linea[0]);
				Integer max = Integer.parseInt(linea[1]);
				
				System.out.println(min+"-"+max);
				
				for(int i=min;i<=max;i++) {
					
					for(int j=1;j<= String.valueOf(max).length()-1;j++) {
						
						String num = new String();
						String num_pre = new String();
						String num_post = new String();
				        String num_final = new String();
				        Integer num_int ;
						num = String.valueOf(i);
						
						num_pre = num.substring(j);
						num_post = num.substring(0, j);
						
						
						
						
						
						num_final = num_pre + num_post; 
						num_int = Integer.parseInt(num_final);
						
						
						
						
						if (min <= i && i < num_int && num_int <= max && min <= num_int && i <= max) {
							System.out.println(num+"-"+num_int);
						
							
							hm.put(num+"-"+num_int, 1);
							
							
						}
							
						
					}
				}
					
				Iterator<?> it = hm.entrySet().iterator();
				while (it.hasNext()) {
					contador++;
					it.next();
				}
				
				out.print("Case #"+z+": ");
				out.print(contador);
				out.println("");
				
			}
			
			out.close();
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}

	}

}
