import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;

public class Recycled {
	public static void main(String[] args) throws Exception{
		String inputFile = "C-small-attempt0.in";
		
		BufferedReader input = new BufferedReader(new InputStreamReader(new FileInputStream(inputFile)));
		BufferedWriter output = new BufferedWriter(new OutputStreamWriter(new FileOutputStream("output")));
		long num_cases = Long.parseLong(input.readLine());
		int current_case = 0;
		
		while (current_case < num_cases){
			current_case++;
			
			String[] fields = input.readLine().split(" ");
			int A = Integer.parseInt(fields[0]);
			int B = Integer.parseInt(fields[1]);
			int total = 0;
			
			for (int n = A; n < B; n++){
				for (int m = n+1; m <= B; m++){
					if (isRecycled(n,m)) total++;
				}
			}
			
			System.out.println("Case #" + current_case + ": " + total);
			output.write("Case #" + current_case + ": " + total + "\n");
		}
		output.close();
	}

	private static boolean isRecycled(int n, int m) {
		String sn = ""+n;
		String sm = ""+m;
		if (sn.length() != sm.length()) return false;
		int totaln = 0, totalm = 0;
		for (int i = 0; i < sn.length(); i++){
			totaln += sn.charAt(i);
			totalm += sm.charAt(i);
		}
		if (totaln != totalm) return false;
		for (int i = 0; i < sn.length()-1; i++){
			sm = sm.charAt(sm.length() - 1) + sm.substring(0, sm.length() - 1);
			if (sm.equals(sn)) return true;
		}
		return false;
	}
}

package recyclednumbers;

import java.util.ArrayList;


public class RecycledNumbers {

    static SimpleReader reader;
    static SimpleWriter writer;
    
    static int low;
    static int high;

    public static void main(String[] args) {
        if (args.length != 1) {
            reader = new SimpleReader();
            writer = new SimpleWriter();
        } else {
            reader = new SimpleReader(args[0]);
            writer = new SimpleWriter(args[1]);
        }
        int cases = reader.readInt();
        int[] lohi;
        for (int i = 0; i < cases; i++) {
            lohi = reader.readIntArray();
            low = lohi[0];
            high = lohi[1];
            solve(i + 1);
            System.out.println("Case " + (i + 1) + " done");
        }
        writer.flush();
        System.out.println("Done");
    }
    
    private static void solve(int caseNo) {
        int ans = 0;
        int length = Integer.toString(low).length();
        for (int i = low; i <= high; i++) {
            String s = Integer.toString(i);
            ArrayList<Integer> seen = new ArrayList<>();
            for (int j = 1; j < length; j++) {
                int cycle = Integer.parseInt(s.substring(j, length) + 
                                             s.substring(0, j));
                if (!seen.contains(cycle) && cycle <= high && cycle > i) {
                    ans++;
                    //System.out.println(Integer.toString(i) + " " + Integer.toString(cycle));
                }
                seen.add(cycle);
            }
        }
        writer.writeLine("Case #" + caseNo + ": " + ans);
    }
    
    private static boolean isRecycled(int n, int m) {
        String ns = Integer.toString(n);
        String ms = Integer.toString(m);
        if (ns.length() != ms.length()) {
            return false;
        }
        for (int i = 1; i < ns.length(); i++) {
            if (ns.equals(ms.substring(i, ms.length()) + ms.substring(0, i))) {
                return true;
            }
        }
        return false;
    }
}
