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){}
	}
}
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;


public class Q3 {

	public static void main (String[] args)
	{
		Scanner s = new Scanner(System.in);
		int numTests = s.nextInt();
		for (int test = 0; test < numTests; test++)
		{
			int a = s.nextInt();
			int b = s.nextInt();
			int count = 0;
			for (int i = a; i < b; i++)
			{
				String si = String.valueOf(i);
				Set<Integer> found = new HashSet<Integer>();
				int div = 1, mul = (int) Math.pow(10, si.length());
				for (int j = 1; j < si.length(); j++)
				{
					div *= 10; mul /= 10;
					int other = (i % div) * mul + (i / div);
					//String sj = si.substring(j) + si.substring(0, j);
					//int other = Integer.parseInt(sj);
					if (!found.contains(other) && other > i && other <= b)
					{
						found.add(other);
						count++;
					}
				}
			}
			System.out.println("Case #" + (test+1) + ": " + count);
		}
	}
	
}
