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.cj.rn;

import com.cj.utils.*;
import java.io.*;
import java.util.Scanner;

public class RecycledNumbers {

	int from;
	int to;
	public String getResult(int caseNo, int from, int to){
		int tempFrom = from;
		int result = 0;
		while(tempFrom<to){
			for(int count=1;(tempFrom+count)<=to;count++){
				int n = tempFrom; 
				String nS = Integer.toString(n);
				int m = tempFrom+count;
				String mS = Integer.toString(m);
				boolean flag = true;
				for(int i=0;i<nS.length();i++){
					if(countOccurrences(mS, nS.charAt(i))!=countOccurrences(nS, nS.charAt(i))){
						flag = false;
					}
				}
				if(flag){
					for(int i=1; i<nS.length(); i++){
						String temp = nS.substring(i)+nS.substring(0, i);
						if(temp.equals(mS)){
							flag = true;
							break;
						}
						else
							flag = false;
					}
				}
				if(flag){
					result++;
					//System.out.println(nS+"<>"+mS);
					}
			}
		tempFrom++;
		}
		return "Case #"+caseNo+": "+result;
	}
	public static int countOccurrences(String haystack, char needle)
	{
	    int count = 0;
	    for (int i=0; i < haystack.length(); i++)
	    {
	        if (haystack.charAt(i) == needle)
	        {
	             count++;
	        }
	    }
	    return count;
	}
	public static void main(String[] args){
		RecycledNumbers obj = new RecycledNumbers();
		System.out.println(obj.getResult(1, 1111, 2222));
		InputReader ir = new InputReader();
        Scanner input = ir.loadInput("C-small-attempt0.in");
        int cases = ir.cases;
        OutputWriter ow = new OutputWriter("C-small-attempt0.out");
        for(int count=0 ; count<cases ; count++){
            //object
        	
        	int n = input.nextInt();
        	int m = input.nextInt();
            String output = obj.getResult(count+1, n, m);

            ow.writeLine(output);
            System.out.println(output);
        }
        ow.closeFile(); 
	}
}
