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

class B
{
	public static void main(String[] args) 
	{
		try
		{
			BufferedReader br = new BufferedReader(new FileReader("B.in"));
			PrintWriter pw = new PrintWriter(new FileWriter("B.out"));
			int X = Integer.parseInt(br.readLine());

			for(int i=0; i<X; i++)
			{
				String[] S = br.readLine().split(" ");
				int A = Integer.parseInt(S[0]);
				int B = Integer.parseInt(S[1]);
				int R = 0;

				int x = 1;
				int n = 0;
				while(A/x > 0) {
					n++;
					x *= 10;
				}

				for(int j=A; j<B; j++) {
					Set<Integer> seen = new HashSet<Integer>();
					for(int k=1; k<n; k++) {
						int p1 = j % (int)Math.pow(10, k);
						int p2 = (int) Math.pow(10, n-k);
						int p3 = j / (int)Math.pow(10, k);
						int y = p1*p2 + p3;
						
						if(j < y && !seen.contains(y) && y <= B) {
							seen.add(y);
							R++;
						}
					}
				}

				pw.printf("Case #%d: %d\n", i+1, R);
				pw.flush();
			}
		}
		catch(Exception e)
		{ 
			e.printStackTrace();
		}
	}
}

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package uk.co.epii.codejam.recyclednumbers;

import java.util.TreeSet;
import uk.co.epii.codejam.common.AbstractProcessor;

/**
 *
 * @author jim
 */
public class RecycledNumbersProcessor extends AbstractProcessor {

    @Override
    public String processLine(String line) {
        DataRow dr = new DataRow(line);
        if (dr.A > dr.B) return "0";
        int count = 0;
        for (int n = dr.A; n < dr.B; n++) {
            String nStr = n + "";
            TreeSet<Integer> m = new TreeSet<>();
            for (int c = 1; c < nStr.length(); c++) {
                int value = cycle(nStr, c);
                if (value > n && value <= dr.B)
                    m.add(value);
            }
            count += m.size();
        }
        return count + "";
    }
    
    public int cycle(String n, int c) {
        String cycled = n.substring(c, n.length()) + n.substring(0, c); 
        return Integer.parseInt(cycled);
    }
    
    
    
}
