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

// CHANGE DATA TYPE FOR LONG SUBMISSION

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

public class P3
{
    public static void main(String[] args) throws Exception
    {
        Scanner sc = new Scanner(new FileReader("input.txt"));
        PrintWriter pw = new PrintWriter(new FileWriter("output.txt"));
        
        int cases = Integer.parseInt(sc.nextLine());
        int c = 0;
        
        for (int i = 0; i < cases; i++)
        {
            int l = sc.nextInt(); // lower limit
            int u = sc.nextInt(); // upper limit
            c = 0;
            
            for(int j = l; j<= u; j++)
            {
                c += noOfCombos(j,l,u);
            }
            
            pw.println("Case #" + (i + 1) + ": " + c);
        }
        
        pw.close();
        sc.close();
    }
    
    static int noOfCombos(int x ,int l, int u) throws Exception
    {
        String s = (x+"");
        int n = 0, c = 0;
        int d = s.length();
        
        for(int i = 1; i<d; i++)
        {
            boolean lz = s.charAt(i) == '0';
            if(!lz)
            {
                n = Integer.valueOf(s.substring(i) + s.substring(0,i));
                if(n >= l && n <= u && n > x) c++;
            }
        }
        return c;
        // 120
        // i = 0 n = 201
        // i = 1 n = 
        // i = 2 n = 
    }
        
}

/*
 * charAt 0 != 0 (leading zero)
 * rotate via int -> string ->  int
 * 
 * n = (int)((x%Math.pow(10,i)*Math.pow(10,d-i+1)) + (x/Math.pow(10,i)));
 */