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 qr2;

import org.junit.Test;

import java.io.BufferedReader;
import java.io.FileInputStream;
import java.io.InputStreamReader;
import java.util.HashSet;

import static junit.framework.Assert.assertEquals;

/**
 * Created with IntelliJ IDEA.
 * User: shtratos
 * Date: 14/04/12
 * Time: 03:39
 */
public class DancingNumbers {

    public static void main(String[] args) {
        DancingNumbers dn = new DancingNumbers();

        //tp.printMapping();
        try {
            BufferedReader br = new BufferedReader(new InputStreamReader(new FileInputStream(args[0])));
            int numOfTests = Integer.valueOf(br.readLine());
            for (int i = 0; i < numOfTests; i++) {
                System.out.println("Case #" + (i + 1) + ": " + dn.getDistinct(br.readLine()));
            }
        } catch (Exception e) {
            e.printStackTrace();  //To change body of catch statement use File | Settings | File Templates.
        }
    }

    @Test
    public void testExamples() {
        DancingNumbers dn = new DancingNumbers();

        assertEquals(0, dn.getDistinct("1 9"));
        assertEquals(3, dn.getDistinct("10 40"));
        assertEquals(156, dn.getDistinct("100 500"));
        assertEquals(287, dn.getDistinct("1111 2222"));
    }

    private int getDistinct(String s) {
        String[] parts = s.split(" ");
        int start = Integer.parseInt(parts[0]);
        int end = Integer.parseInt(parts[1]);
        HashSet<String> pairs = new HashSet<String>();
        for (int m = start + 1; m <= end; m++) {
            for (int n = start; n < m; n++) {
                String recycle = recycle(n, m);
                if (recycle != null) {
                    pairs.add(recycle);
                }
            }
        }
        return pairs.size();
    }

    private String recycle(int n, int m) {
        String ns = String.valueOf(n);
        String ms = String.valueOf(m);
        if (ms.length() != ns.length()) return null;
        if ((ns + ns).contains(ms)) {
            return n + " " + m;
        } else {
            return null;
        }
    }
}
