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


public class Recycled {
	public static void main (String[] args) { 
		Scanner sc = new Scanner(System.in);
		int lines = sc.nextInt();
		for (int i=0; i<lines; i++) {
			int min = sc.nextInt();
			int max = sc.nextInt();
			
			int count = 0;
			for (int n=min; n<=max; n++) {
				int d = countDigit(n);
				ArrayList<Integer> swappedValues = new ArrayList<Integer>();
				for (int s=1; s<=d; s++) {
					int tens = tenPowerOf(s);
					int headDigits = d-s;
					int head = n/tens;
					int tail = n%tens;
					
					int minTail = minWithNumberOfDigits(s);
					if (tail>=minTail) {
						int newNum = tail*tenPowerOf(headDigits)+head;
						if (newNum>=min && newNum<=max && newNum!=n) {
							int size = swappedValues.size();
							Boolean isNew = true;
							for (int j=0; j<size; j++) {
								int val = swappedValues.get(j);
								if (val==newNum) {
									isNew = false;
									break;
								}
							}
							if (isNew) {
								swappedValues.add(newNum);
								count++;
							}
						}
					}
				}
			}
			
			count /= 2;
			System.out.println("Case #"+(i+1)+": "+count);
		}
	}
	
	static int countDigit (int n) {
		int digits = 1;
		n = n/10;
		while (n>0) {
			digits++;
			n = n/10;
		}
		return digits;
		
	}
	
	static int tenPowerOf(int p) {
		int res = 0;
		if (p>0) {
			res = 10; // power of 1
			for (int i=2; i<=p; i++) {
				res *= 10;
			}
		}
		return res;
	}
	
	static int minWithNumberOfDigits(int d) {
		return tenPowerOf(d-1);
	}
}
