package Main;

import com.sun.deploy.util.ArrayUtil;
import org.apache.commons.lang3.ArrayUtils;

import java.io.*;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.HashSet;

/**
 * Created with IntelliJ IDEA.
 * User: arran
 * Date: 14/04/12
 * Time: 3:12 PM
 * To change this template use File | Settings | File Templates.
 */
public class Round {
    public StringBuilder parse(BufferedReader in) throws IOException {
        StringBuilder out = new StringBuilder();
        String lineCount = in.readLine();

        for (int i = 1; i <= Integer.parseInt(lineCount); i++)
        {
            out.append("Case #"+i+": ");
            System.err.println("Case #"+i+": ");
            String line = in.readLine();
            String[] splits = line.split(" ");
            int p1 = Integer.valueOf(splits[0]);
            int p2 = Integer.valueOf(splits[1]);
            int r = pairRecyclable(p1, p2);
            out.append(r);

//            if (i < Integer.parseInt(lineCount))
                out.append("\n");
        }
        return out;
    }

    public static int pairRecyclable(int i1, int i2) {
        HashSet<String> hash = new HashSet<String>();
        for (int i = i1; i < i2; i++)
        {
            String istr = String.valueOf(i);
            if (istr.length() < 2) continue;
            for (int p = 0; p < istr.length() ; p++)
            {
                String nistr = istr.substring(p,istr.length()).concat(istr.substring(0,p));
                if (Integer.valueOf(nistr) < i1) continue;
                if (Integer.valueOf(nistr) > i2) continue;
                if (nistr.equals(istr)) continue;
                String cnistr = (Integer.valueOf(nistr) > Integer.valueOf(istr)) ?  istr + "," + nistr : nistr + "," + istr;
                hash.add(cnistr);
            }
        }
        return hash.size();
    }

    public static void main(String[] args) {
        InputStreamReader converter = null;
        try {
            int attempt = 0;
            String quest = "C";
//            String size = "small-attempt";
            String size = "large";
            converter = new InputStreamReader(new FileInputStream("src/resource/"+quest+"-"+size+".in"));
            BufferedReader in = new BufferedReader(converter);
            Round r = new Round();
            String str = r.parse(in).toString();
            System.out.print(str);
            FileOutputStream fos = new FileOutputStream(quest+"-"+size+".out");
            OutputStreamWriter osw = new OutputStreamWriter(fos);
            BufferedWriter bw = new BufferedWriter(osw);
            bw.write(str);
            bw.flush();
            bw.close();
        } catch (IOException e) {
            e.printStackTrace();
        }

    }
}

import java.util.*;

public class RecycledNumbers{
	
	static HashSet<String> hs;
	public static int single(int n, int[] digits){
		int i = 0;
		while(n>0){
			digits[i] = n%10;
			n = n/10;
			i++;
		}
		return i;
	} 	
	
	public static int toNumber(int[] d){
		int n = 0;
		for(int i = d.length-1; i>=0; i--){
			n = (n*10)+d[i];
		}		
		return n;
	}
	
	public static int pairs(int nd, int[] d, int ja, int m){
		int total = 0;
		int last = nd -1;
	
		for(int ni = 0; ni<last; ni++){
			//System.out.println("Moving "+d[ni]);
			int[] arr = new int[nd];
			int pa  = 0;
			for(int i = ni+1; i< nd; i++){
				arr[pa] = d[i];
				pa++;
			}
			for(int i = 0; i<=ni; i++){
				arr[pa] = d[i];
				pa++;
			}
			//System.out.println("Array "+Arrays.toString(arr));
			int nn = toNumber(arr);
			//System.out.println("New number "+nn);
			if((nn>ja) && nn <= m){
				total++;
				hs.add(ja+","+nn);		
			}
			
		}
		
		return total;
	}

	public static int solve(int a, int b){
		String sa = a+"";
		String sb = b+"";
		hs =  new HashSet<String>();
		int la = sa.length();
		int lb = sb.length();
		if(la == 1)
			return 0;
		int[] digitsa  = new int[7];
		
		int[] digitsb  = new int[7];
		int ndigits = single(a, digitsa);
		single(b, digitsb);
		int  count  = 0;
		for(int ja =a; ja < b; ja++){
			int[] digitsja  = new int[7];
//			System.out.println("Checking "+ja);
			single(ja, digitsja);
			int npa = pairs(ndigits, digitsja, ja, b );
			
			count+=npa;	
			if(npa > 0){
	//			System.out.println("j "+ja+" npa "+npa);
			}
		}
		//System.out.println(count);
		return hs.size();
	}
	
	public static void main(String args[]){
		Scanner s = new Scanner(System.in);
		int T = s.nextInt();
		
		for(int i = 0; i<T; i++){
			
			int a, b;
			a = s.nextInt();
			b = s.nextInt();
			
			System.out.println("Case #"+(i+1)+": "+solve(a, b));
			
		}

	}
}