package qual;

import java.util.Scanner;

public class RecycledNumbers {

	public static void main(String[] args) {
		new RecycledNumbers().run();

	}

	private void run() {
		Scanner sc = new Scanner(System.in);
		int T = sc.nextInt();
		for (int t = 0; t < T; t++) {
			int A = sc.nextInt();
			int B = sc.nextInt();
			int result = solve(A, B);
			System.out.printf("Case #%d: %d\n", t + 1, result);
		}
	}

	public int solve(int A, int B) {
		int result = 0;
		for (int i = A; i <= B; i++) {
			int dig = (int) Math.log10(A/*same as B*/) + 1;
			int aa = i;
			for (int d = 0; d < dig - 1; d++) {
				aa = (aa % 10) * (int)Math.pow(10, dig - 1) + (aa / 10);
				if (i == aa) {
					break;
				}
				if (i < aa && aa <= B) {
//					System.out.printf("(%d, %d) ", i, aa);
					result++;
				}
			}
		}
		return result;
	}

}


public class Hehe {

	/**
	 * @param args
	 */
	public static int n(int A, int B){
		
		// TODO Auto-generated method stub
		int start=A;
		int end=B;
		int count=0;
		MyNumbers myNumbers = new MyNumbers();
		MyNumbers myCheck = new MyNumbers();
		for( int k = start; k<=end; k++)
		{
			int a =k;
			
			
			String s = Integer.valueOf(a).toString();
			for(int i=0; i<s.length(); i++)
			{
				CharSequence c = s.subSequence(0, i);
				String s2 = s.concat(c.toString());
				s2 = s2.substring(i);
				
				int n = Integer.parseInt(s2);

				if(n<=end && n>=start  && a!=n && !myCheck.numbers.contains(n))
				{
					//System.out.println(s+"  "+s2);
					myNumbers.add(n);
					myCheck.add(a);
					count++;
				}
				
			}
			//myNumbers.numbers.removeAll(myCheck.numbers);
			
		}
		
		System.out.println(myNumbers.numbers.size()+"  count: "+count);
		return count;

	}

}
