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 com.develog;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.StringTokenizer;

public class C {
	final int A = 0;
	final int B = 1;
	
	BufferedReader reader;
	BufferedWriter writer;
	String buf;
	String numStr[];
	
	public C() throws IOException{
		reader = new BufferedReader(new FileReader("C-large.in"));
		writer = new BufferedWriter(new FileWriter("output.txt"));
		
		reader.readLine(); // # of case
		long cnt;
		
		for(int n=1; (buf = reader.readLine()) != null;	n++){
			numStr = getToken(buf);
			cnt = solve(numStr);
//			System.out.println(cnt);
			writer.write(String.format("Case #%d: %d\n", n, cnt));
		}
		reader.close();
		writer.close();
	}
	
	public String[] getToken(String sentence){
		String ret[] = new String[2];
		StringTokenizer token = new StringTokenizer(sentence, " \t");
		int i=0;
		while(token.hasMoreTokens()){
			ret[i++] = token.nextToken();
		}
		return ret;
	}
	
	public long solve(String str[]){
		long num[] = new long[2];
		long m;
		long cnt=0;
		ArrayList<Long> arNum;
		num[A] = Integer.parseInt(str[A]);
		num[B] = Integer.parseInt(str[B]);
		
		for(long a=num[A], b=num[B]; a<=b; a++){
			StringBuilder builder = new StringBuilder(String.valueOf(a));
			int len = builder.length();
			arNum = new ArrayList<Long>();
			for(int i=0; i<len-1; i++){
				builder.append(builder.charAt(0));
				builder.delete(0, 1);
				m = Long.parseLong(builder.toString());
				if(!arNum.contains(m) && a < m && m <= b){
					cnt++;
					arNum.add(m);
				}
			}
			
		}
		return cnt;
	}
}
