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 com.gnooo;

import java.util.HashMap;
import java.util.Scanner;

public class Solution {
	static final boolean DBG = false;

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int T = sc.nextInt();

		long dStart = System.currentTimeMillis();

		StringBuilder sb = new StringBuilder();
		for (int i = 1; i <= T; i++) {
			OneTask task = new OneTask(sc.nextInt(), sc.nextInt());
			long res = task.getSolution();
			sb.append("Case #");
			sb.append(i);
			sb.append(": ");
			sb.append(res);
			sb.append('\n');
		}

		if (DBG) {
			sb.append("time :");
			sb.append(System.currentTimeMillis() - dStart);
		}
		System.out.print(sb.toString());

	}

	static class OneTask {
		long a, b;

		public OneTask(long a, long b) {
			this.a = a;
			this.b = b;
		}

		long getSolution() {
			long c = 0;

			for (long i = a; i < b; i++) {
				c += numberHasRecycledPairs(a, b, i);
			}
			return c;
		}

	}

	static long numberHasRecycledPairs(long min, long max, long no) {
		String str = String.valueOf(no);

		final int len = str.length();
		int res = 0;
		HashMap<Long, Integer> map = new HashMap<Long, Integer>();
		for (int i = 1; i < len; i++) {
			long tmp = Long.parseLong(str.substring(len - i)
					+ str.substring(0, len - i));
			if (min <= tmp && tmp <= max && tmp > no) {
				if (!map.containsKey(tmp)) {
					res++;
					map.put(tmp, 0);
				}
			}
		}

		return res;
	}
}
