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 dom.zar.jam.qualifications;

import java.util.Scanner;

public class RecycledNumbers {

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int inputLines = in.nextInt();
		for (int i = 0; i < inputLines;) {
			int a = in.nextInt();
			int b = in.nextInt();						
			System.out.println("Case #" + ++i + ": "
					+ result(a, b));
		}
	}
	
	private static int result(int a, int b) {
		int size = b - a + 1;
		int[] nums = new int[size];
		for (int i = 0; i < size; ++i) nums[i] = a + i;
		
		int counter = 0;
		for (int i = 0; i < size; ++i) {
			if (nums[i] > -1) {
				counter += rotate(nums[i], a, b, nums);
				nums[i] = -1;
			}
		}		
		return counter;
	}
	
	private static int rotate(Integer n, int a, int b, int[] nums) {
		String valString = n.toString();
		int length = valString.length();
		valString = valString + valString;
		int counter = 0;
		for (int i = 1; i < length; ++i) {
			int rotated = Integer.parseInt(
					valString.substring(i, i + length));
			if (rotated > n && rotated <= b
					&& nums[rotated - a] != -1) {
				counter++;
				nums[rotated - a] = -1;
			}
		}
		return (counter * (counter + 1)) >> 1;
	}
}
