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

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;

public class ProblemC {
	
	public static int solve(int A, int B){
		
		int count = 0;
		
		for (int i = A; i <= B; i++){
			String number = String.valueOf(i);
			String s = number + number;
			for (int j = 1; j < number.length(); j++){
				int newnumber = Integer.parseInt(s.substring(j, j + number.length()));
				if ((newnumber > i) && (newnumber <= B))
					count++;
			}
		}
		
		return count;
	}
	
	public static void main(String[] args){
		try{
			BufferedReader br = new BufferedReader(new FileReader("C-large.in"));
			BufferedWriter bw = new BufferedWriter(new FileWriter("outputC-large"));
			String line = br.readLine();
			int ans = 0;
			int num = Integer.parseInt(line);
			
			for (int i = 0; i < num; i++){
				line = br.readLine();
				String[] segs = line.split("\\s+");
				ans = solve(Integer.parseInt(segs[0]), Integer.parseInt(segs[1]));
				bw.write("Case #" + (i+1) + ": " + ans + "\n");
			}
			
			br.close();
			bw.close();
		}catch(Exception e){
			e.printStackTrace();
		}
	}

}
