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

import java.io.File;
import java.io.FileWriter;
import java.util.ArrayList;
import java.util.Scanner;

/**
 *
 * @author daniele
 */
public class GCJ_C {
    
    public static void main(String[] args) throws Exception{
        
        
        
        Scanner in = new Scanner(new File(args[0]));
        FileWriter out = new FileWriter("/home/daniele/Scrivania/Output");
        

        int prove=in.nextInt();
        int min,max;
        int cifre;
        int cifreaus;
        String temp;
        int aus;
        int count=0;
        ArrayList<Integer> vals = new ArrayList<Integer>();
        int jcount=0;
        ArrayList<Integer> perm = new ArrayList<Integer>();
        
        out.write("");
        out.flush();
        
        for(int i=1;i<=prove;i++){
            
            out.append("Case #" +i+": ");out.flush();
            
            min=in.nextInt();
            max=in.nextInt();
            
            for(int j=min;j<=max;j++){
               if(!vals.contains(j)){
                    temp=""+j;
                    cifre=temp.length();
                    aus=j;
                    perm.add(j);
                    for(int k=1;k<cifre;k++){
                        aus=rotateOnce(aus);
                        temp=""+aus;
                        cifreaus=temp.length();//elusione zeri iniziali
                        if(aus>=min && aus<=max && aus!=j && cifreaus==cifre && nobody(vals,perm)){ 
                            perm.add(aus);
                            jcount ++;
                            
                        }
                        
                    }
                    while(jcount>0){count+=jcount; jcount--;}
                    vals.addAll(perm);
                    perm= new ArrayList<Integer>();
                    
                }
            }
            out.append(count+"\n");out.flush();
            count=0;
            vals= new ArrayList<Integer>();
        }
        
        
        
    }
        static public int rotateOnce(int n){
            String s=""+n;
            if(s.length()>1){
                s=s.charAt(s.length()-1) + s.substring(0,s.length()-1);
                n=Integer.parseInt(s);
            }
            return n;
        }    
        
        static public boolean nobody(ArrayList<Integer> v,ArrayList<Integer> a){;
            for(int i=0;i<a.size();i++)
                if(v.contains(a.get(i))) return false;
            return true;
        } 
    
}


import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.List;

public class RecycledNumbers {
	public static void main(String[] args) {
		try {
			File dataFile = new File(args[0]);
			File outputFile = new File(args[1]);
			if (dataFile.exists()) {
				BufferedReader reader = new BufferedReader(new FileReader(dataFile));
				FileWriter writer = new FileWriter(outputFile, false);

				int maxIteration = Integer.valueOf(reader.readLine());
				int currentLine = 0;
				String line;
				
				while ((line = reader.readLine()) != null && currentLine < maxIteration) {
					int result = 0;
					HashMap<Integer, List<Integer>> recycled = new HashMap<Integer, List<Integer>>();
					String[] AB = line.split(" ");
					for (int min = Integer.valueOf(AB[0]), max = Integer.valueOf(AB[1]), i = min ; i < max ; i++) {
						String currVal = String.valueOf(i);
						String rotatedVal = currVal;
						for (int j = 0; j < currVal.length() - 1; j++){
							rotatedVal = rotateRight(rotatedVal);
							if (String.valueOf(Integer.valueOf(rotatedVal)).length() != String.valueOf(Integer.valueOf(currVal)).length())
								continue;
							int iVal = Integer.valueOf(rotatedVal);
							if (iVal >= min && iVal <= max && iVal != i) {
								int key, val;
								if (i < iVal) {
									key = i;
									val = iVal;
								} else {
									key = iVal;
									val = i;
								}
								if (recycled.containsKey(key)) {
									List<Integer> allVal = recycled.get(key);
									if (allVal != null) {
										if (!allVal.contains(val)) {
											allVal.add(val);
											result++;
										}
									}
								} else {
									List<Integer> addedVal = new ArrayList<Integer>();
									addedVal.add(val);
									recycled.put(key, addedVal);
									result++;
								}
							}
						}
					}

					writer.write("Case #" + ++currentLine + ": " + result + "\n");
				}
				reader.close();
				writer.close();
			}
		} catch (Exception exc) {
			exc.printStackTrace();
		}
	}
	
	private static String rotateRight(String sInput) {
		int len = sInput.length();
		char[] outstring = sInput.toCharArray();
		
		char ch = outstring[len - 1];
		for (int j = len -1; j > 0; j--) {
			outstring[j] = outstring[j - 1];
		}
		outstring[0] = ch;
		return String.valueOf(outstring);
	}
}
