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.*;
import java.util.*;

public class ProbC {
    public static void main(String[] args) throws FileNotFoundException, IOException {
        ProbC p = new ProbC();
        p.solveAll();
    }
    int tests = 0;
    Scanner in;
    BufferedWriter out;
    public ProbC() throws FileNotFoundException, IOException {
        out = new BufferedWriter(new FileWriter("c.out"));
        in = new Scanner(new File("c.in"));
        tests = in.nextInt();
        in.nextLine();
        //System.out.println(tests);
    }

    public void solveAll() throws IOException {
        //System.out.println(move(11, 1));
        ///*
        for(int i = 0; i < tests; i++) {
            solve(i+1);
        }
        out.close();
        in.close();//*/
    }
    public void solve(int casenr) throws IOException {
        int A, B, res = 0;
        A = in.nextInt();
        B = in.nextInt();
        int[] perm = new int[100];
        for(int i = A; i <= B; i++) {
            int d = digits(i);
            for(int j = 1; j < d; j++) {
                int m = move(i, j);
                boolean found = false;
                for(int k = 1; k < j; k++) {
                    if(perm[k] == m)
                        found = true;
                }
                perm[j] = m;
                if(!found && valid(A, B, i, m))
                    res++;
            }
        }
        out.write("Case #"+casenr+": ");
        out.write(new Integer(res).toString());
        out.write('\n');
    }
    public int digits(int nr) {
        int d = 0;
        while(nr > 0) {
            nr /= 10;
            d++;
        }
        return d;
    }

    public int move(int nr, int pos) {
        String nrs = new Integer(nr).toString();
        String rs = nrs.substring(nrs.length()-pos);
        rs = rs + nrs.substring(0, nrs.length()-pos);
        return new Integer(rs).intValue();
    }

    public boolean valid(int A, int B, int n, int m) throws IOException {
        /*if(A <= n && n < m && m <= B)
            out.write(n+" "+m+" "+'\n');//*/
        return A <= n && n < m && m <= B;
    }
}