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.ArrayList;
import java.util.List;

public class RecyclePair {
	
	private static boolean IsRecycle(int a, int n, int m, int b, List<String> pairs, String pair){
		return a <= n && n < m && m <= b && !pairs.contains(pair);
	}
	
	public static int Calculate(int a, int b){
		int count = 0;

		List<String> pairs = new ArrayList<String>();

		for(int n=a;n<=b;n++){
			for(int j=1;j<String.valueOf(n).length(); j++){
				String m = String.valueOf(n).substring(j) + String.valueOf(n).substring(0, j);
				String pair = n + "," + m;

				if(IsRecycle(a, n, Integer.parseInt(m), b, pairs, pair)){
					pairs.add(pair);    
					count++;
				}
			
			}
		}

		return count;
	}
}
