import java.util.Scanner;
import java.io.*;
import java.lang.Math;


public class C{
	public static int recycle(String str){
		String[] numbers = str.split(" ");
		int min = Integer.parseInt(numbers[0]);
		int max = Integer.parseInt(numbers[1]);
		int ret = 0;

		for(int i = min; i < max; i++){
			String num = i + "";
			int len = num.length();
			int k = i;
			for(int j = 1; j < len; j++){
				k = (k/10) + (int)java.lang.Math.pow(10.0,(double)(len-1))*(k%10);
				if (k > i && k <= max)
					ret++;
				else if(k == i)
					break;
			}
		}

		return ret;
	}

	public static void main(String[] args){
		Scanner sc = null;
		String next;
		int out;
		try{
			sc = new Scanner(new File("C-large.in"));
			int cases = Integer.parseInt(sc.nextLine());
			int current = 0;
			

			FileWriter fs = new FileWriter("output.txt");
			BufferedWriter buff = new BufferedWriter(fs);
			while(current < cases){
				next = sc.nextLine();
				current++;
				out = recycle(next);
				buff.write("Case #" + current + ": " + out + "\n");
			}
			buff.close();
		}
		catch(Exception ex){}
	}
}
package egWo;

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

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

		for (int l = 1; l <= T; l++) {
			in.nextLine();
			int n = in.nextInt();
			int m = in.nextInt();
			int count = 0;
			for (int i = n; i < m; i++) {
				int uv = 0;
				for (int j = 1000000; j >= 1; j = j / 10) {
					if (m / j > 0 && m / j < 10) {
						uv = j;
					}
				}
				ArrayList revI = new ArrayList();
				int s = 10;
				for (int c = uv; c >= 10; c = c / 10) {
					int h = i / c;
					int t = i % c;
					int rev = (t * s) + h;
					s *= 10;
					revI.add(rev);
				}
				Set set = new HashSet(revI);
				for (Object j : set) {
					if (i < ((Integer) j).intValue()
							&& ((Integer) j).intValue() <= m) {
						count++;
					}
				}
			}
			System.out.format("\nCase #%d: %d", l, count);
		}		
	}
}
