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.File;
import java.io.FileOutputStream;
import java.io.PrintStream;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class RecycledNumbers {
	public static void main(String[] args) {
		try {
			System.setOut(new PrintStream(new FileOutputStream("output.txt")));
			Scanner scanner = new Scanner(new File(args[0]));
			int testsNum = scanner.nextInt();
			
			String solution;
			for (int i=1; i<=testsNum; i++) {
				solution = solve(scanner);
				System.out.println("Case #"+i+": "+solution);
				System.err.println("Case #"+i+": "+solution);
			}
		} catch (Exception e) {e.printStackTrace();}
	}
	
	static class Pair {
		private int n;
		private int m;
		public Pair(int n, int m) {this.n=n; this.m=m;}
		public int hashCode() {return n^m;}
		public boolean equals(Object o) {
			if (!(o instanceof Pair)) return false;
			Pair p = (Pair)o;
			return n==p.n && m==p.m;
		}
		
	}
	
	private static String solve(Scanner scanner) {
		int A = scanner.nextInt();
		int B = scanner.nextInt();
		
		int ret=0;
		int r;

		int digits;
		Set<Pair> pairs = new HashSet<Pair>();
		Pair pair;
		for (int n=A; n<=B; n++) {
			digits = (int)Math.ceil(Math.log10(n));
			if (n>10) {
				for (int d=1; d<digits; d++) {
					r = rotate(n,d);
					if (n<r && r<=B) {
						pair = new Pair(n,r);
						if (!pairs.contains(pair)) {
							pairs.add(new Pair(n,r));
							ret++;
						}
					}
				}
			}
		}
		return ""+ret;
	}
	
	private static int rotate(int n, int pos) {
		return n%(int)Math.pow(10,pos)*(int)Math.pow(10, Math.ceil(Math.log10(n))-pos)+n/(int)Math.pow(10, pos);
	}
}
