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

package recycled;

import java.io.BufferedReader;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.TreeSet;

/**
 *
 * @author Alfred
 */
public class Main {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
    try {
            FileInputStream fstream = new FileInputStream("C-small-attempt0.in");
            DataInputStream in = new DataInputStream(fstream);
            BufferedReader br = new BufferedReader(new InputStreamReader(in));
            FileWriter outFile = new FileWriter("out.txt");
            PrintWriter out = new PrintWriter(outFile);
            String line;
            line = br.readLine();
            int cases = Integer.parseInt(line);
            for (int i=1; i<=cases;i++){
                line = br.readLine();
                String[] values = line.split(" ");
                int A = Integer.parseInt(values[0]);
                int B = Integer.parseInt(values[1]);
                int total=0;
                for (int n=A; n<=B;n++){
                    TreeSet<String> solutions = new TreeSet<String>();
                    for (int k=1;k<values[1].length();k++){
                        String m = circshift(n,k);
                        int mVal = Integer.parseInt(m);
                        if(mVal<=B && mVal!=n  && mVal> n && !m.startsWith("0") && m.length()==Integer.toString(n).length() )
                        {
                            solutions.add(m);
                        }                   
                    }
                    total+=solutions.size();
                }
                out.println("Case #"+i+": "+total);
            }
            in.close();
            out.close();
        } catch (Exception e) {//Catch exception if any
            System.err.println("Error: " + e.getMessage());
        }

}

    private static String circshift(int n, int k) {
        String nString=Integer.toString(n);
        int len=nString.length();
        String m =  nString.substring(len-k)+nString.subSequence(0, len-k);
        //System.out.println(n+" "+m);
        return m;
    }

}

import java.text.NumberFormat;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Iterator;
import java.util.Scanner;
import java.util.Set;


public class Problem3 {
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		
		int lineNo = scan.nextInt();
		
		for(int i = 0 ; i < lineNo ; i++) {
			int a = scan.nextInt();
			int b = scan.nextInt();
			
//			String aString = String.valueOf(a);
			String bString = String.valueOf(b);
			
			int stringLength = bString.length();
			
//			HashMap<String, String> recycleMap = new HashMap<String, String>();
			Set<Pair> pairSet = new HashSet<Pair>();
			
			int size = 0;
			for(int j = a ; j <= b ; j++) {
				String numString = String.format("%0" + stringLength + "d", j);
				
				String movedString = new String(numString);
				for(int k = 0 ; k < stringLength ; k++) {
					String frontString = String.valueOf(movedString.charAt(0));
					movedString = movedString.substring(1) + frontString;
					int movedInt = Integer.parseInt(movedString);
					if(a <= movedInt && movedInt <= b && movedInt > j) {
//						recycleMap.put(numString, movedString);
						pairSet.add(new Pair(j, movedInt));
						
//						System.out.println(numString + ": " + movedString);
						size++;
					}
				}
			}
			
			System.out.println("Case #" + (i+1) + ": " + pairSet.size());
			
			// For Test
//			System.out.println("=== Test Map ===");
//			
//			Set<String> keyMap =  recycleMap.keySet();
//			for(Iterator<String> iter = keyMap.iterator() ; iter.hasNext() ; ) {
//				String key = iter.next();
//				String value = recycleMap.get(key);
//				
//				System.out.println(key + ": " + value);
//			}
		}
	}
} 

class Pair {
	int min;
	int max;
	
	public Pair(int a, int b) {
		if(a < b) {
			min = a;
			max = b;
		}
		else  {
			min = b;
			max = a;
		}
	}

	@Override
	public int hashCode() {
		final int prime = 31;
		int result = 1;
		result = prime * result + max;
		result = prime * result + min;
		return result;
	}

	@Override
	public boolean equals(Object obj) {
		if (this == obj)
			return true;
		if (obj == null)
			return false;
		if (getClass() != obj.getClass())
			return false;
		Pair other = (Pair) obj;
		if (max != other.max)
			return false;
		if (min != other.min)
			return false;
		return true;
	}
}
