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.Arrays;
import java.util.Collections;
import java.util.SortedSet;
import java.util.TreeSet;



public class Executer {

	protected static final String FICHERO_ENTRADA_SHORT = "C-small-attempt0.in";
	protected static final String FICHERO_SALIDA_SHORT = "C-small-attempt0.out";
	protected static final String FICHERO_ENTRADA_LARGE = "C-large-attempt0.in";
	protected static final String FICHERO_SALIDA_LARGE = "C-large-attempt0.out";

	
	/**
	 * @param args
	 */
	public static void main(String[] args){

		TemplateClass test;
		try{
			
			//SHORT VERSION
			test = new Recycled(FICHERO_ENTRADA_SHORT, FICHERO_SALIDA_SHORT);
			//LARGE VERSION
			//test = new Store(FICHERO_ENTRADA_LARGE, FICHERO_SALIDA_LARGE);
			
			test.procesaTestCase();
		}catch (Exception e){
			System.out.println("ERROR");
		}
	
	}
	
}
