import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashSet;

public class Recycled {
    public static void main(String[] args) {
        try {
            BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
            int t = Integer.parseInt(br.readLine());
            for (int i = 0; i < t; i++) {
                String[] str = br.readLine().split(" ");
                int a = Integer.parseInt(str[0]);
                int b = Integer.parseInt(str[1]);
                System.out.println("Case #" + (i + 1) + ": " + find(a, b));
            }
        } catch (IOException e) {
            e.printStackTrace();
        }
    }

    private static int find(int a, int b) {
        HashSet<Long> used = new HashSet<Long>();
        int digits = String.valueOf(a).length();
        if (digits == 1) return 0;
        for (int i = a; i <= b; i++) {
            int s = 10;
            int m = (int) Math.pow(10, digits-1);
            for (int j = 0; j < digits-1; j++) {
                int r = i % s;
                if (r < s/10) continue;
                int q = i / s;
                int rn = r * m + q;
                s *= 10; m /= 10;
                if (i != rn && rn >= a && rn <= b) {
                    long pp;
                    if (rn < i) pp = (long)rn << 30 | i;
                    else pp = (long)i << 30 | rn;
                    if (!used.contains(pp)) {
                        used.add(pp);
                    }
                }
            }
        }
        return used.size();
    }
}

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

public class ProblemC {
	public static void main(String[] args) {
		/*
		try {
			System.setIn(new FileInputStream("c-example.in"));
		} catch (Exception e) {}
		*/
		new ProblemC();
	}
	
	public ProblemC() {
		Scanner input = new Scanner(System.in);
		int cases = input.nextInt();
		for (int n = 0; n < cases; n++) {
			int lower = input.nextInt();
			int upper = input.nextInt();
			System.out.println("Case #" + (n+1) + ": " + findPairs(lower, upper));
		}
	}
	
	private int findPairs(int lower, int upper) {
		List<Integer> pairs = new ArrayList<Integer>();
		for (int i = lower; i <= upper; i++) {
			List<Integer> p = recycle(i);
			for (int j : p) {
				if (j >= i && j <= upper) {
					pairs.add(j);
					//System.out.println(i + ", " + j);
				}
			}
		}
		return pairs.size();
	}
	
	private List<Integer> recycle(int n) {
		List<Integer> p = new ArrayList<Integer>();
		int m = n;
		int len = Integer.toString(n).length();
		int mult = (int)Math.pow(10, len - 1);
		for (int i = 0; i < len; i++) {
			int d = m % 10;
			m /= 10;
			m += (d * mult);
			if (m != n && len == Integer.toString(m).length() && !p.contains(m)) {
				p.add(m);
			}
		}
		return p;
	}
}
