import java.io.FileInputStream;
import java.util.HashMap;
import java.util.Scanner;
import java.util.TreeSet;

// Recycled Numbers
// https://code.google.com/codejam/contest/1460488/dashboard#s=p2

public class C {

	private static String process(Scanner in) {
		int A = in.nextInt();
		int B = in.nextInt();
		int res = 0;
		int len = Integer.toString(A).length();
		for(int n = A; n < B; n++) {
			String str = Integer.toString(n);
			TreeSet<Integer> set = new TreeSet<Integer>();
			for(int i = 1; i < len; i++) {
				int m = Integer.parseInt(str.substring(i, len) + str.substring(0, i));
				if ( m > n && m <= B && ! set.contains(m) ) {
					set.add(m);
					res++;
				}
			}
		}
		return Integer.toString(res);
	}

	public static void main(String[] args) throws Exception {
		Scanner in = new Scanner(System.in.available() > 0 ? System.in : 
			new FileInputStream(Thread.currentThread().getStackTrace()[1].getClassName() + ".practice.in"));
		int T = in.nextInt();
		for(int i = 1; i <= T; i++) 
			System.out.format("Case #%d: %s\n", i, process(in));
	}
}

import java.util.*;
import java.math.*;

public class recycledNumbers {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		
		Scanner scan = new Scanner(System.in);
		int numStrings = scan.nextInt();
		
		for(int i =1; i <= numStrings; i++){
			
			int lowerBound = scan.nextInt();
			int upperBound = scan.nextInt();
			int numDigits = Integer.toString(lowerBound).length();
			int ten = 10;
			
			int count = 0;
			for(int j = lowerBound; j <= upperBound ; j++){
				int temp = j;
				for(int k = 1; k <= numDigits; k++){
					int temp_rem = temp % ten;
					int temp_quot = temp /ten;
					int temp1 = temp_quot + (int )(Math.pow(ten, numDigits-1))*temp_rem;
					if (temp1 > j && temp1 <= upperBound){
						count = count + 1;
					}	
					temp = temp1;
					//System.out.println("\n" + j + " " + temp + " " + upperBound + " " + count);
				}
			}
			//System.out.println("LowerBound: " + lowerBound + "\n");
			//System.out.println("UpperBound: " + upperBound + "\n");
			//System.out.println("numDigits: " + numDigits + "\n");
			System.out.format("Case #%d: %d\n", i, count);
			
		}

	}

}
