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.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayList;


	public class Main_c_new {
		public static void main(String[] args) throws Exception{
			BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
			int cases=Integer.parseInt(in.readLine());
			for(int i=1;i<=cases;i++)
			{
				int count = 0;
				String line = in.readLine();
				String parts[] = line.split(" ");
				int a = Integer.parseInt(parts[0]);
				int b = Integer.parseInt(parts[1]);
				for(int j=a;j<b;j++){
					int temp = j;
					int length = 0;
					for(int k=0;k<8;k++){
						length++;
						temp/=10;
						if(temp<=0){
							break;
						}
					}
					ArrayList<Integer> list = new ArrayList<Integer>();
					for(int k=1;k<length;k++){
						 
						int div = (int)Math.pow(10,k);
						int part1 = j/div;
						int part2 = j%div;
						if(part2 >= (int)(Math.pow(10, k-1))){
							int num = (part2*((int)Math.pow(10, length-k)))+part1;
							if(num>j && num<=b){
								int flag = 0;
								for(int l=0; l<list.size();l++){
									if(list.get(l) == num){
										flag = 1;
									}
								}
								
								if(flag == 0){
								count++;
								list.add(num);
								}
							}
						}
					}
						
					}

				System.out.println("Case #"+i+": "+count);
			}
		}
	}
