import java.io.*;

class code1
{
	public static void main(String args[]) throws Exception 
	{
		File ii = new File ("C-small-attempt1.in");
		FileInputStream fis = new FileInputStream(ii);
		BufferedReader  br = new BufferedReader(new InputStreamReader (fis));
		int cases = Integer.parseInt(br.readLine());
		FileOutputStream fout = new FileOutputStream ("output.txt");
		DataOutputStream dout = new DataOutputStream (fout);
		int total=0;
		for(int i=0;i<cases;i++){
		String temp = br.readLine();
		String parts [] = temp.split(" ");
		int lower = Integer.parseInt(parts[0]);
		int upper = Integer.parseInt(parts[1]);
		System.out.println(lower+" "+upper);
		
		for(int j=lower;j<=upper;j++)
		{
			int abc = j;int length=0;
			if(j<10)continue;
			while (abc!=0){abc/=10;length++;}
			abc=j;
			for(int m=0;m<length-1;m++){
				int shift = abc%10;
				abc=abc/10;
				System.out.println("hi "+j);
				abc=abc+shift*power(10,length-1);
				if(abc<=upper&&shift!=0&&abc>j)total++;
				System.out.println(total);
			}
		}
 		dout.writeBytes("Case #"+(i+1)+ ": "+total+"\n");
 		total=0;
		}//for close
		
	}

	private static int power(int i, int j) {
		int no=1;
		for(int a=0;a<j;a++){no=10*no;}
		return no;
	}
}
package qual;

import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

class RecycledPair
{
	int a; 
	int b;
	
	public RecycledPair(int a, int b) {
		super();
		this.a = a;
		this.b = b;
	}

	@Override
	public int hashCode() {
		final int PRIME = 31;
		int result = 1;
		result = PRIME * result + (a + b);
		result = PRIME * result + (a + b);
		return result;
	}

	@Override
	public boolean equals(Object obj) {
		if (this == obj)
			return true;
		if (obj == null)
			return false;
		if (getClass() != obj.getClass())
			return false;
		final RecycledPair other = (RecycledPair) obj;
		if (a == other.a && b==other.b)
			return true;
		if (a == other.b && b==other.a)
		    return true;
		return false;
	}
	
	
	
}
public class RecycledNumbers {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);

		int T = in.nextInt();

		in.nextLine();

		for (int t = 0; t < T; t++) {
			String s = in.nextLine();
			String[] limit = s.split(" ");
			int A = Integer.parseInt(limit[0]);
			int B = Integer.parseInt(limit[1]);

			Set<RecycledPair> recycledPairsEncountered = new HashSet<RecycledPair>();

			int count = 0;
			for (int i = A; i <= B; i++) 
			{
				char[] num = String.valueOf(i).toCharArray();

				for (int k = num.length - 1; k >= 1; k--) 
				{
					String recycledNumber = "";
					if (num[k] != '0') 
					{
						int indx = k;
						while (indx < num.length)
							recycledNumber += num[indx++];
						indx = 0;
						while (indx < k)
							recycledNumber += num[indx++];
					}

					if (!recycledNumber.equals("")) 
					{
						int recycledNum = Integer.parseInt(recycledNumber);

						if (recycledNum != i
								&& recycledNum <= B
								&& recycledNum >= A)
						{
						     RecycledPair r = new RecycledPair(i, recycledNum);	
						     if(recycledPairsEncountered.contains(r)==false)
						     {
						    	 recycledPairsEncountered.add(r);
						     	 count++;
						     }
						}
					}
				}
			}

			System.out.println("Case #" + (t + 1) + ":" + " " + count);
		}
	}

}
