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

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package RecycledNumbers;

import java.io.File;
import java.io.FileWriter;
import java.io.Writer;
import java.util.LinkedList;
import java.util.List;
import java.util.Scanner;

/**
 *
 * @author Rishabh
 */
public class RecycledNumbers {
    
    public void readFile(String path) throws Exception{
        File f = new File(path);
        Scanner scan = new Scanner(f);
        String name = f.getName().substring(0,f.getName().indexOf('.'));
        Writer writer = new FileWriter(name+".out");
        int total_cases = Integer.parseInt(scan.nextLine());
        int caseno=0;
        while(scan.hasNextLine()){
            caseno++;
            long[] toIntArray = toIntArray(scan.nextLine().split(" "));
            int ans = compute((int)toIntArray[0],(int)toIntArray[1]);
            writer.write("Case #"+caseno+": "+ans+"\r\n");
        }
        writer.close();
        scan.close();
    }
    
    public static long[] toIntArray(String[] arr){
        long[] new_arr = new long[arr.length];
        int count = 0;
        for(String g : arr){
            new_arr[count] = Long.parseLong(g);
            count++;
        }
        return new_arr;
    }

    private int compute(int A, int B) {
        int count=0;
        List[] l = new LinkedList[B-A+1];
        for(int i=A;i<=B;i++){
            int c = getAllPermutations(i, A, B, l);
            count += c;
            //System.out.println("permutations for : "+i+" are " + c);
        }
        return count;
    }
    
    private int getAllPermutations(int num, int A, int B, List[] l){
        String g = String.valueOf(num);
        List<Integer> permutations = new LinkedList<Integer>();
        boolean found = false;
        for(int i=1;i<g.length();i++){
            String new_g = g.substring(i) + g.substring(0, i);
            if(new_g.charAt(0) == '0')
                continue;
            int parseInt = Integer.parseInt(new_g);
            if(parseInt>B||parseInt<A||parseInt==num)
                continue;
            found = false;
            for(int n : permutations){
                if(n==parseInt){
                    found = true;
                    break;
                }
            }
            if(found)
                continue;
            if(l!=null && contains(l[num-A],parseInt))
                continue;
            permutations.add(parseInt);
            if(l[parseInt-A]==null){
                l[parseInt-A] = new LinkedList();
            }
            l[parseInt-A].add(num);
        }
        return permutations.size();
    }
    
    private boolean contains(List l, int n){
        if(l != null)
            for(Object k : l){
                if(n==(Integer)k)
                    return true;
            }
        return false;
    }
    
    public static void main(String args[]) throws Exception{
        RecycledNumbers recycledNumbers = new RecycledNumbers();
        recycledNumbers.readFile("A-small-practice.in");
    }
    
}
