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

import java.io.File;
import java.io.FileNotFoundException;
import java.util.HashSet;
import java.util.Scanner;

public class recycled {

    static void print(int nbCases, int N, int S, int P, int[] T) {
	System.out.print(N + " ");
	System.out.print(S + " ");
	System.out.print(P);
	for (int j = 0; j < N; j++)
	{
	    System.out.print(" " + T[j]);
	}
	System.out.println();
    }

    static int RecycledNumbers(int A, int B) {
	int res = 0;
	double d = Math.log10(A);
	int n = (int) Math.floor(Math.log10(A)) + 1;
	// System.out.println(" A = " + A + "B = " + B);
	// System.out.println(" N = " + n + " pour d = " + d);
	int flag = 0;
	HashSet<Couple> l = new HashSet<Couple>();
	for (int i = A; i <= B; i++)
	{
	    for (int j = 1; j < n; j++)
	    {
		int p = (int) (((int) Math.pow(10, n - j)) *
		               (i % (int) Math.pow(10, j)) + i /
		                                             Math.pow(10, j));
		if (i < p && p >= A && p <= B && p / Math.pow(10, n) != 0 && !l.contains(new Couple(i, p)))
		{
		    flag += 1;
		    res += 1;
		    l.add(new Couple(i,p));
		    //if (flag >1)
		    //	System.out.println("FLAG");
		    //System.out.println(" Couple : (" + i + ", " + p + ")");
		}
		
	    }
	    flag = 0;
	}
	return res;
    }
    static void run(int A, int B, int turn) {
	System.out.println("Case #" + turn + ": " + RecycledNumbers(A, B));
    }

    /**
     * @param args
     * @throws FileNotFoundException
     */
    public static void main(String[] args) throws FileNotFoundException {
	Scanner f = new Scanner(
	        new File(
	                "C:\\Users\\Jean-Baptiste\\Desktop\\Info2A\\GoogleJam\\src\\Recycled.in"));
	int nbCases = f.nextInt();
	int A = 1;
	int B = 1;

	for (int i = 0; i < nbCases; i++)
	{
	    A = f.nextInt();
	    B = f.nextInt();

	    run(A, B, i + 1);
	}

	int n = 6;
	int i = 123456;
	int j = 4;
	int p = (int) (((int) Math.pow(10, n - j)) *
	               (i % (int) Math.pow(10, j)) + i / Math.pow(10, j));
	//System.out.println(" Pour i = 123456 et j = 3 : " + p);
	f.close();
    }

}
