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;
	}
}

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

class Recycling {
    static Scanner sc;

    static ArrayList<Integer> found;

    static void run()
    {
        int A = sc.nextInt();
        int B = sc.nextInt();

        found = new ArrayList<Integer>();

        int total = 0;
        
        for (int n = A; n < B; n++) {
            total += findPerms(n, A, B);
        }

        System.out.println(total + "");
    }

    static int findPerms(int n, int A, int B)
    {
        int perms = 0;

        // first generate the perm list
        ArrayList<Integer> a = toArrayList(n);

        // find all permutations of n
        // and check if n < m <= B
        
        for (int i = 0; i < a.size(); i++) {
            next_number(a);
            int m = toNumber(a);
            int ff = 1000000000 * n + m;
            //System.out.println(m);
            if (n < m && A <= m && m <= B && !found.contains(ff)) {
                perms++;
                found.add(ff);
                //System.out.println(m + " <<");
            }
        }
        
        return perms;
    }

    static ArrayList<Integer> toArrayList(int a)
    {
        ArrayList<Integer> b = new ArrayList<Integer>();
        for (int i = numdigits(a); i > 0; i--) {
            b.add(nthdigit(a, i - 1));
            //System.out.print(nthdigit(n, i - 1) + " ");
        }
        return b;
    }

    static int toNumber(ArrayList<Integer> a)
    {
        int n = 0;
        for (int i = 0; i < a.size(); i++) {
            n *= 10;
            n += a.get(i);
        }
        return n;
    }

    static int nthdigit(int x, int n)
    {
        while (n-- != 0) {
            x /= 10;
        }
        return (x % 10);
    }

    static int numdigits(int x)
    {
        int d = 0;
        while (x != 0) {
            x /= 10;
            d++;
        }
        return d;
    }

    static void next_number(ArrayList<Integer> a)
    {
        Collections.swap(a, 0, a.size() - 1);

        for (int i = 0; i < a.size() - 2; i++) {
            Collections.swap(a, a.size() - (2 + i), a.size() - (1 + i));
        }
    }

    public static void main(String args[])
    {
        sc = new Scanner(System.in);

        int cases = Integer.parseInt(sc.nextLine());
        for (int i = 0; i < cases; i++) {
            System.out.print("Case #" + (i + 1) + ": ");
            run();
        }
    }
}
