import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;


public class Main {

//	static int MAX = 10000;
	static int MAX = 2000000;
	static Object[] All = new Object[MAX+1];
	
	static int size( int x ) {
		if(x>999999) return 7;
		if(x>99999)  return 6;
		if(x>9999)   return 5;
		if(x>999)    return 4;
		if(x>99)     return 3;
		if(x>9)      return 2;
		return 1;
	}
	static int[] rotate( int value ) {
		List<Integer> result = new ArrayList<Integer>();
		int[] V = new int[8];
		int s = size(value);
		int x = value;
		
		for(int i=s-1;i>=0;i--) {
			V[i] = x%10;
			x /=10;
		}
		int rot;
		for(int i=1; i<s; i++) {
			if(V[i]!=0){
				rot=0;
				for(int j=0,ii=i;j<s; j++,ii=(ii+1)%s){
					rot=rot*10+V[ii];
				}
				if(rot>value && !result.contains(rot))
					result.add(rot);
			}
		}
		if( result.isEmpty() )
			return null;
		int[] r = new int[result.size()];
		for(int i=0; i<r.length; i++)
			r[i]=result.get(i);
		return r;
	}
	
	static void precalculate() {
		for(int i=1; i<=MAX; i++){
			All[i] = rotate(i);
		}
	}
	static int solve( Scanner in ) {
		int A, B, sol=0;
		
		A = in.nextInt();
		B = in.nextInt();

		for( int i=A; i<=B; i++) {
//			List<Integer> result = rotate(i);
			if( All[i]!=null ) {
				for(int value: (int[])All[i] ) {
					if( value <= B )
						sol++;
				}
			}
		}

		return sol;
	}
	
	public static void main ( String args[] ) {
		int T; 
		Scanner in = new Scanner(System.in);
		T = in.nextInt();
		int cnt=0;
		int sol;
		precalculate();
		for( cnt=1; cnt<=T; cnt++ ) {
			sol = solve( in );
			System.out.printf("Case #%d: %d\n", cnt, sol);
		}

	}
}

import java.io.File;
import java.io.FileNotFoundException;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;


public class recycled {
	
	static HashMap<Long, HashMap<Long, Integer>> found;
	static Set<Long> touched;
	
	public static int calc(long a, long b){
		int compteur = 0;
		int nbchiffres = 1;
		long pow = 10;
		while(pow<a){
			pow=pow*10;
			nbchiffres++;
		}
		for(long n=a; n<=b; n++){
			if(n>pow){
				pow=pow*10;
				nbchiffres++;
			}
			//System.out.println(n+" "+a+" "+b);
			compteur+= nbpossibleM(a,b,n, nbchiffres, pow);
		}
		return compteur;
	}

	private static int nbpossibleM(long a, long b, long n, int nbchiffre, long pow) {
		long smallpow = 10;
		long bigpow = pow/10;
		//System.out.println("-------- "+nbchiffre+" "+smallpow+" "+bigpow+"\n\n\n");
		long m=0;
		int possibilities =0;
		touched.clear();
		for(int k=1; k<nbchiffre; k++){
			m= n/smallpow + (n%smallpow)*bigpow;
			if(m<n && m>=a && !touched.contains(m)){
				/*if(found.containsKey(m)){
					HashMap<Long, Integer> map = found.get(m);
					if(map.containsKey(n)){
						map.put(n, map.get(n)+1);
					}
					else{
						map.put(n, 1);
					}
				}
				else{
					HashMap<Long,Integer> map = new HashMap<Long, Integer>();
					map.put(n, 1);
					found.put(m, map);
				}*/
				possibilities++;
				touched.add(m);
			}
			smallpow=smallpow*10;
			bigpow=bigpow/10;
		}
		return possibilities;
	}
	
	public static void main(String[] args) throws FileNotFoundException{
		//found = new HashMap<Long	, HashMap<Long, Integer>>();
		touched = new HashSet<Long>();
		Scanner s = new Scanner(new File("input.txt"));
		int nbcas = s.nextInt();
		
		for(int i=0; i<nbcas; i++){
			long a = s.nextLong();
			long b = s.nextLong();
			System.out.println("Case #"+(i+1)+": "+calc(a,b));
		}
		
		/*
		for(long m: found.keySet()){
			HashMap<Long, Integer> map = found.get(m);
			for(long n: map.keySet()){
				if(map.get(n)==2){
					System.out .println(m+" "+n);
				}
			}
		}*/
	}
}
