import java.io.FileInputStream;
import java.util.HashMap;
import java.util.Scanner;
import java.util.TreeSet;

// Recycled Numbers
// https://code.google.com/codejam/contest/1460488/dashboard#s=p2

public class C {

	private static String process(Scanner in) {
		int A = in.nextInt();
		int B = in.nextInt();
		int res = 0;
		int len = Integer.toString(A).length();
		for(int n = A; n < B; n++) {
			String str = Integer.toString(n);
			TreeSet<Integer> set = new TreeSet<Integer>();
			for(int i = 1; i < len; i++) {
				int m = Integer.parseInt(str.substring(i, len) + str.substring(0, i));
				if ( m > n && m <= B && ! set.contains(m) ) {
					set.add(m);
					res++;
				}
			}
		}
		return Integer.toString(res);
	}

	public static void main(String[] args) throws Exception {
		Scanner in = new Scanner(System.in.available() > 0 ? System.in : 
			new FileInputStream(Thread.currentThread().getStackTrace()[1].getClassName() + ".practice.in"));
		int T = in.nextInt();
		for(int i = 1; i <= T; i++) 
			System.out.format("Case #%d: %s\n", i, process(in));
	}
}

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

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
import java.util.Arrays;

/**
 *
 * @author kent.wangsawan
 */
public class soal2 {
    public static void main(String [] args) throws IOException{
        BufferedReader input = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer tok;
        int tc = Integer.parseInt(input.readLine());
        for(int i = 0; i<tc; i++){
            tok = new StringTokenizer(input.readLine());
            int awal = Integer.parseInt(tok.nextToken());
            int akir = Integer.parseInt(tok.nextToken());
            int count = 0;
            for(int j = awal; j<akir; j++){
                int temp = j;
                if(temp<10) continue;
                else if(temp< 100){
                    int a = temp%10;
                    temp = temp/10;
                    temp += a*10;
                    if(temp >= awal && temp <= akir && temp > j) {
                        count++;
                    }
                }
                else if(temp<1000){
                    for(int k = 0; k<2; k++){
                        int a = temp%10;
                        temp = temp/10;
                        temp += a*100;
                        if(temp >= awal && temp <= akir && temp > j) {
                            count++;
                        }
                        else if (temp == j)
                            break;
                    }
                }
                else if(temp < 10000){
                    for(int k = 0; k<3; k++){
                        int a = temp%10;
                        temp = temp/10;
                        temp += a*1000;
                        if(temp >= awal && temp <= akir && temp > j) {
                            count++;
                        }
                        else if (temp == j)
                            break;
                    }
                }
            }
            System.out.println("Case #"+(i+1)+": "+count);
        }
    }
}
