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

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.Reader;
import java.io.StreamTokenizer;


public class MySolution {
	public static void main(String[] a) throws IOException {
		sumfile("C-large.in");
	}

	static void sumfile(String filename) throws IOException {
		int tests=0;
		int A=0;
		int B=0;
		int count=0;
		Reader r = new BufferedReader(new FileReader(filename));
		StreamTokenizer stok = new StreamTokenizer(r);
		stok.parseNumbers();
		stok.nextToken();
		if (stok.ttype == StreamTokenizer.TT_NUMBER) {
			tests=(int)stok.nval;
		}
		FileWriter fw = new FileWriter("result.txt");
		fw.write("");
		fw.close();
		for(int i=0;i<tests;i++){
			stok.nextToken();
			if (stok.ttype == StreamTokenizer.TT_NUMBER) {
				A=(int)stok.nval;
			}
			stok.nextToken();
			if (stok.ttype == StreamTokenizer.TT_NUMBER) {
				B=(int)stok.nval;
			}
			for(int ii=A;ii<=B;ii++){
				String tmp = ii+"";
				int size=tmp.length();
				int[] allchange=new int[size-1];
				for(int j=1;j<size;j++){
					String tmp2=tmp.substring(j, tmp.length())+tmp.substring(0, j);
					int change=Integer.parseInt(tmp2);
					allchange[j-1]=change;
					int sign=0;
					for(int k=0;k<j-1;k++){
						if(allchange[k]==change){
							//System.out.println("Bingo"+ii);
							sign=1;
						}
					}
					if(change>ii&&change<=B&&sign!=1){
						count++;
						//System.out.print("("+ii+","+change+") ");
					}
				}
				
				
			}
			
			fw = new FileWriter("result.txt",true);  
			String s ="Case #"+(i+1)+": "+count+"\n";  
			fw.write(s,0,s.length());  
			fw.flush();
			System.out.println("Case #"+(i+1)+": "+count);
			count=0;
		}
	}
}
