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.Scanner;


public class RecycledNumbers {

	private Integer a;
	private Integer b;
	private Integer caseNumber;
	private Integer numberOfDigits;
	
	public RecycledNumbers(int caseNumber,String data) {
		// TODO Auto-generated constructor stub
		Scanner s=new Scanner(data);
		this.a=s.nextInt();
		this.b=s.nextInt();
		this.caseNumber=caseNumber;
		this.numberOfDigits=a.toString().length();
				
	}
	
	public void process() {
		int count=0;
		
		
		for(Integer i=a;i<b;i++){
			
			//ArrayList<Integer> temp=new ArrayList<Integer>();
			
			for(int j=1;j<numberOfDigits;j++){
				
				String temp=i.toString();
				temp= temp.substring(j).concat(temp.substring(0, j));
				Integer temp1=Integer.parseInt(temp);
				
				if(temp1<=b && temp1>i){
					count++;
					//System.out.println(i+" "+temp1);
				}
				
			}
			
		}
		
		System.out.println("Case #"+caseNumber+": "+count);
	}
	
	
}
