import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashSet;

public class Recycled {
    public static void main(String[] args) {
        try {
            BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
            int t = Integer.parseInt(br.readLine());
            for (int i = 0; i < t; i++) {
                String[] str = br.readLine().split(" ");
                int a = Integer.parseInt(str[0]);
                int b = Integer.parseInt(str[1]);
                System.out.println("Case #" + (i + 1) + ": " + find(a, b));
            }
        } catch (IOException e) {
            e.printStackTrace();
        }
    }

    private static int find(int a, int b) {
        HashSet<Long> used = new HashSet<Long>();
        int digits = String.valueOf(a).length();
        if (digits == 1) return 0;
        for (int i = a; i <= b; i++) {
            int s = 10;
            int m = (int) Math.pow(10, digits-1);
            for (int j = 0; j < digits-1; j++) {
                int r = i % s;
                if (r < s/10) continue;
                int q = i / s;
                int rn = r * m + q;
                s *= 10; m /= 10;
                if (i != rn && rn >= a && rn <= b) {
                    long pp;
                    if (rn < i) pp = (long)rn << 30 | i;
                    else pp = (long)i << 30 | rn;
                    if (!used.contains(pp)) {
                        used.add(pp);
                    }
                }
            }
        }
        return used.size();
    }
}

package contest;

import java.io.BufferedReader;

import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.StringTokenizer;
import java.util.Set; 
import java.util.HashSet;

public class RecycledNumbers {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		
		try {
			
			int T = Integer.parseInt(in.readLine());
			for (int tc = 0; tc<T; tc++) { 
				String testCase = in.readLine();
				StringTokenizer st = new StringTokenizer(testCase); 
				
				int A = Integer.parseInt(st.nextToken()); 
				int B = Integer.parseInt(st.nextToken());
				
				Map<Integer, Set<Integer>> map = new HashMap<Integer, Set<Integer>>();
				
				int count = 0;
				for (int n=A; n<=B; n++) { 
					List<Integer> list = getRecList(n);
					for (int m: list) { 
						if (m<=B && n<m) { 
							if (map.containsKey(n)) {
								if (map.get(n).contains(m)) { 
									//this pair already exists, skip
								}
								else { 
									map.get(n).add(m);
									count++;
								}
								
							} else { 
								Set<Integer> s = new HashSet<Integer>(); 
								s.add(m);
								map.put(n, s);
								count++;
							}
//							System.out.println("(" +n+ "," + m + ")");//testing
						}
					}
				}
				System.out.println("Case #" + (tc+1) + ": " + count);
			}
		} catch (IOException e) {
			e.printStackTrace();
		}

	}
	
	private static List<Integer> getRecList(int n) { 
		List<Integer> ret = new ArrayList<Integer>(); 

		String str = Integer.toString(n);
		
//		System.out.println("processing " + n); //testing
		for (int i = str.length()-1; i>0;i--) { 
			ret.add(Integer.parseInt(str.substring(i, str.length()) + str.substring(0, i)));
//			System.out.println("adding: " + Integer.parseInt(str.substring(i, str.length()) + str.substring(0, i)));//testing
		}
		
		return ret;
	}
	
	

}
