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.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.Scanner;
public class C {
	public static void main(String[] args) throws Exception{
		Scanner sc = new Scanner(new File("C.in"));
		long tt = System.currentTimeMillis();
		PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("C.out")));
		HashSet<String> HS = new HashSet<String>();
		LinkedList<obj> LL = new LinkedList<obj>();
		int N = 1;
		
		for(int i=1;i<=N;i++){
			
			int A = 1;
			int B = 2000000;
			for(int a=A;a<=B;a++){
				String x = a+"";
				for(int b=1;b<x.length();b++){
					String temp = x.substring(b)+x.substring(0,b);
					if(temp.charAt(0)=='0')continue;
					int other = Integer.parseInt(temp);
					if(other>a&&other>=A&&other<=B){
						if(HS.contains(x+" "+temp))continue;
						HS.add(x+" "+temp);
						LL.add(new obj(a,other));
					}
				}
			}
		}
		//System.out.println(HS.size());
		N = sc.nextInt();
		for(int i=1;i<=N;i++){
			int A = sc.nextInt();
			int B = sc.nextInt();
			int total = 0;
			for(obj x : LL){
				
				int T1 = x.x;
				int T2 = x.y;
				if(A<=T1&&T1<=B&&A<=T2&&T2<=B){
					total++;
				}
				//System.out.println(total);
			}
			out.println("Case #"+i+": "+total);
			//System.out.println("Case #"+i+": "+total);
		}
		out.close();
		//System.out.println(System.currentTimeMillis()-tt);
	}
	static class obj{
		int x; 
		int y;
		obj(int a, int b){
			x=a;
			y=b;
		}
	}
}
