package codejam;

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

public class RecycledNumbers {
	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new FileReader("in.txt"));
		PrintWriter out = new PrintWriter(new File("out.txt"));
		
		int T = Integer.parseInt(in.readLine());
		for (int t = 1; t <= T; ++t) {
			String[] parts = in.readLine().split("[ ]+");
			int A = Integer.parseInt(parts[0]);
			int B = Integer.parseInt(parts[1]);
			
			int cnt = 0;
			for (int i = A; i < B; ++i) {
				String str = String.valueOf(i);
				int n = str.length();
				String res = "";
				Set<Integer> seen = new HashSet<Integer>();
				for (int j = n - 1; j > 0; --j) {
					res = str.substring(j) + str.substring(0, j);
					int k = Integer.parseInt(res);
					if (k > i && k <= B) {
						//System.out.println("(" + i + ", " + k + ")");
						if (!seen.contains(k)) {
							++cnt;
							seen.add(k);
						}
					}
				}
			}

			out.println("Case #" + t + ": " + cnt);
		}
		
		in.close();
		out.close();
		System.exit(0);
	}
}

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package recyclednumber;

/**
 *
 * @author pos
 */
public class Numbers {

    int A;
    int B;
    int n;
    int m;
    int Result;

    public Numbers(int A, int B) {
        this.A = A;
        this.B = B;
        this.n = A;
        this.m = n + 1;
    }
    
    String sn;
    String sm;
    int nLength;
    int mLength;
    int nIndex;
    int mIndex;

    private boolean isValid(int n, int m) {
        int[] numberN = new int[10];
        int[] numberM = new int[10];

        sn = n + "";
        sm = m + "";
        nLength = sn.length();
        mLength = sm.length();

        for (int i = 0; i < nLength; i++) {
            nIndex = Integer.valueOf(sn.charAt(i)) - 48;
            numberN[nIndex]++;
            mIndex = Integer.valueOf(sm.charAt(i)) - 48;
            numberM[mIndex]++;
        }
        for (int i = 0; i < 10; i++) {
            if (numberN[i] != numberM[i]) {
                return false;
            }
        }
        //System.out.println(A + "<=" + n + "<" + m + "<=" + B);
        return true;
    }

    public void Calculate() {
        int n, m;
        for (int i = this.A; i < this.B; i++) {
            for (int j = i+1; j <= this.B; j++) {
                n = i;
                m = j;
                if (isValid(n, m))
                    isRecycled(n, m);
            }
        }
    }
    
    private boolean isRecycled(int n, int m){
        String sn=n+"";
        nLength=sn.length();
        for(int i=1;i<nLength;i++){
            if (Integer.valueOf(sn.substring(i)+sn.substring(0, i))==m){
                Result++;
                return true;
            }
        }
        return false;
    }
}
