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

import java.io.BufferedWriter;
import java.io.FileWriter;
import java.util.ArrayList;
import common.FileRead;

public class ConNumMain 
{
	public static int intSize(int num)
	{
		if(num <10)
		{
			return 1;
		}
		else if(num<100)
		{
			return 2;
		}
		else if(num<1000)
		{
			return 3;
		}
		else if(num <10000)
		{
			return 4;
		}
		else if(num < 100000)
		{
			return 5;
		}
		else if(num < 1000000)
		{
			return 6;
		}
		else 
		{
			return 7;
		}
	}

	public static void main(String args[])
	{
		StringBuffer sb,sb1;
		BufferedWriter out=null;
		FileWriter fstream=null;
		int intcase=0,a,b;
		ArrayList<Integer> arr,arr1,arr2;
		boolean flag=false;
		String str1=null;
		try
		{
			
			sb=FileRead.read();
			String str[]=sb.toString().split("\n");
			fstream = new FileWriter("D:/tony/code jam/Recycledf Numbfers/C-small-attempt0.out");
			out=new BufferedWriter(fstream);
			for(int i=1;i<=(Integer.parseInt(str[0]));i++)
			{
				arr1=new ArrayList<Integer>();
				arr2=new ArrayList<Integer>();
				a=Integer.parseInt(str[i].split(" ")[0]);
				b=Integer.parseInt(str[i].split(" ")[1]);
				if(a<10)
				{
					a=10;
				}
				for(int j=a;j<=b;j++)
				{
					if(j>1111)
					{
						j=j+1-1;
					}
					str1=String.valueOf(j);
					arr=new ArrayList<Integer>();
					for(int k=1;k<intSize(j);k++)
					{
						//arr.add(Integer.rotateRight(j, k+1));
						sb1=new StringBuffer(""); 
						for(int r=1;r<str1.length();r++)
						{
							sb1=sb1.append(str1.charAt(r));
						}
						sb1=sb1.append(str1.charAt(0));
						str1=sb1.toString();
						arr.add(Integer.parseInt(sb1.toString()));
					}
					for(int m=0;m<arr.size();m++)
					{
						if(arr.get(m)>=a && arr.get(m)<=b && !arr.get(m).equals(j))
						{
							flag=false;
							for(int p=0;p<arr1.size();p++)
							{
								if((arr1.get(p).equals(j) && arr2.get(p).equals(arr.get(m))) || (arr2.get(p).equals(j) && arr1.get(p).equals(arr.get(m))))
								{
									flag=true;
									break;
								}
							}
							if(flag==false)
							{
								arr1.add(j);
								arr2.add(arr.get(m));
							}
							
						}
						
					}
				}
				out.write("Case #"+(++intcase)+": "+arr1.size()+"\n");
			}
			
		}
		 catch (Exception e)
		  {
			  System.err.println("Error: " + e.getMessage());
		  }
		finally
		{
			try
			{
				out.close();
				fstream.close();
			}
			 catch (Exception e)
			  {
				  System.err.println("Error: " + e.getMessage());
			  }
		}
		
	}
}
