import java.io.*;
import java.util.*;

public class C {

    void solve() throws IOException {
        in("C-large.in"); out("C-large.out");

        long tm = System.currentTimeMillis();
        boolean[] mask = new boolean[2000000];
        int[] r = new int[10];
        int t = readInt();
        for (int cs = 1; cs <= t; ++cs) {
            int a = readInt();
            int b = readInt();
            int ans = 0;
            for (int m = a + 1; m <= b; ++m) {
                char[] d = String.valueOf(m).toCharArray();
                int c = 0;
                for (int i = 1; i < d.length; ++i) {
                    if (d[i] != '0' && d[i] <= d[0]) {
                        int n = 0;
                        for (int j = 0; j < d.length; ++j) {
                            int jj = i + j;
                            if (jj >= d.length) jj -= d.length;
                            n = n * 10 + (d[jj] - '0');
                        }
                        if (n >= a && n < m && !mask[n]) {
                            ++ans;
                            mask[n] = true;
                            r[c++] = n;
                        }
                    }
                }
                for (int i = 0; i < c; ++i) {
                    mask[r[i]] = false;
                }
            }
            println("Case #" + cs + ": " + ans);
            //System.out.println(cs);
        }
        System.out.println("time: " + (System.currentTimeMillis() - tm));
        exit();
    }

    void in(String name) throws IOException {
        if (name.equals("__std")) {
            in = new BufferedReader(new InputStreamReader(System.in));
        } else {
            in = new BufferedReader(new FileReader(name));
        }
    }

    void out(String name) throws IOException {
        if (name.equals("__std")) {
            out = new PrintWriter(System.out);
        } else {
            out = new PrintWriter(name);
        }
    }

    void exit() {
        out.close();
        System.exit(0);
    }

    int readInt() throws IOException {
        return Integer.parseInt(readToken());
    }

    long readLong() throws IOException {
        return Long.parseLong(readToken());
    }

    double readDouble() throws IOException {
        return Double.parseDouble(readToken());
    }

    String readLine() throws IOException {
        st = null;
        return in.readLine();
    }

    String readToken() throws IOException {
        while (st == null || !st.hasMoreTokens()) {
            st = new StringTokenizer(in.readLine());
        }
        return st.nextToken();
    }

    boolean eof() throws IOException {
        return !in.ready();
    }

    void print(String format, Object ... args) {
        out.println(new Formatter(Locale.US).format(format, args));
    }

    void println(String format, Object ... args) {
        out.println(new Formatter(Locale.US).format(format, args));
    }

    void print(Object value) {
        out.print(value);
    }

    void println(Object value) {
        out.println(value);
    }

    void println() {
        out.println();
    }

    StringTokenizer st;

    BufferedReader in;
    PrintWriter out;

    public static void main(String[] args) throws IOException {
        new C().solve();
    }
}

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


public class Recycle2 {

	
	private static int solve(int L, int H) {
		class Slice {
			int L,H,mul,dig;
			Slice(int LL,int HH,int Mull,int digg) {
				L=LL; H=HH; mul=Mull; dig=digg;
			}
			public String toString() { return String.format("%d-%d, %d(%d)", L,H,mul,dig); }
		}
			
		ArrayList<Slice> slices = new ArrayList<Slice>();
			
		int k = 10, d=1;
		int l = L, h=H;
		while(true) {
			if (l>=k) {
				k*=10;d++;
				continue;
			}
			if (h<k) {
				slices.add( new Slice(l,h,k/10,d));
				break;
			} else {
				slices.add( new Slice(l,k-1,k/10,d));
				l=k;
				k=k*10;d++;
				continue;
			}
		}
		
		class Pair {
			int i,j;
			Pair(int ii,int jj) {i=ii;j=jj;}
			boolean equal(Pair p) {
				return p.i==i && p.j==j;
			}
			public String toString() { return String.format("(%d,%d)",i,j); }
		}
		
		ArrayList<Pair> ps = new ArrayList<Pair>();
		
		int ret = 0;
		//System.out.println(slices);
		for(Slice slice:slices) {
			for(int i=slice.L; i<=slice.H; i++) {
				int n=i;
				ArrayList<Integer> past = new ArrayList<Integer>();
				for (int j=0;j<(slice.dig-1);j++) {
					int dd=n%10;
					n=(n/10)+dd*slice.mul;
					if (n>i && n<=slice.H && !past.contains(n)) {
						//System.out.println("checking (" + i + ", " + n + ")");
						/*Pair p=new Pair(i,n);
						for(Pair c:ps) {
							if (c.equal(p)) {
								System.out.println("Duplicate: " + p);
							}
						}
						ps.add(p);*/
						ret++;
						past.add(n);
					}
				}
				
			}
		}
	
		return ret;
	}
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		
		Scanner in = new Scanner(System.in);
		int T = in.nextInt();
		for(int t=1;t<=T;t++) {
			int L = in.nextInt();
			int H = in.nextInt();
			System.out.printf("Case #%d: %d%n", t, solve(L,H));
		}

	}

}
