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.File;
import java.lang.StringBuilder;
import java.util.Scanner;
import java.io.FileWriter;

public class RN {
	
	public static void main(String[] args) throws Exception{
		File input = new File("C-small-attempt1.in");
		File output = new File("output.out");
		FileWriter fw = new FileWriter(output);
		Scanner s = new Scanner(input);
		
		int numloops = s.nextInt();
		StringBuilder sb = new StringBuilder();
		
		for(int n=0; n<numloops; n++){
			sb.append("Case #" + (n+1) + ": ");
			
			int low = s.nextInt();
			int hi = s.nextInt();
			int numrepeats = 0;
			
			for(int i=low; i<hi; i++){
				String strnum = "" + i;
				//System.out.println(strnum);
				
				for(int j=1; j<strnum.length(); j++){
					String rotstr = strnum.substring(j) + strnum.substring(0,j);
					//System.out.println(rotstr);
					int rotval = Integer.parseInt(rotstr);
					rotstr = "" + rotval;
					
					if(rotval > i && rotval <= hi ){//&& rotstr.length() == strnum.length()){
						numrepeats++;
						//System.out.println(strnum + " " + rotstr);
					}
					
					if(rotval == i)
						;//break; //already had a repeating number
				}
			}
			sb.append(numrepeats + "\n");
			//fw.append(numrepeats + "\n");
		}
		fw.write(sb.toString());
		fw.close();
	}
}
