package qual;

import java.util.Scanner;

public class RecycledNumbers {

	public static void main(String[] args) {
		new RecycledNumbers().run();

	}

	private void run() {
		Scanner sc = new Scanner(System.in);
		int T = sc.nextInt();
		for (int t = 0; t < T; t++) {
			int A = sc.nextInt();
			int B = sc.nextInt();
			int result = solve(A, B);
			System.out.printf("Case #%d: %d\n", t + 1, result);
		}
	}

	public int solve(int A, int B) {
		int result = 0;
		for (int i = A; i <= B; i++) {
			int dig = (int) Math.log10(A/*same as B*/) + 1;
			int aa = i;
			for (int d = 0; d < dig - 1; d++) {
				aa = (aa % 10) * (int)Math.pow(10, dig - 1) + (aa / 10);
				if (i == aa) {
					break;
				}
				if (i < aa && aa <= B) {
//					System.out.printf("(%d, %d) ", i, aa);
					result++;
				}
			}
		}
		return result;
	}

}

import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.util.Scanner;

/**
 * Created with IntelliJ IDEA.
 * User: aeg
 * Date: 12/04/14
 * Time: 22:58
 * To change this template use File | Settings | File Templates.
 */
public class ReceycledNumbers {
    public static void main (String[] argc) throws FileNotFoundException {
        ReceycledNumbers  renum = new ReceycledNumbers();
        renum.solve();

    }

    private void solve() throws FileNotFoundException {
        FileInputStream fis = new FileInputStream("csv/QR_C/C-small-attempt1.in");
        Scanner sc = new Scanner(fis);

        int T = sc.nextInt();

        loop:
        for (int i = 0; i < T; i++) {
            int A = sc.nextInt();
            int B = sc.nextInt();
            int count =0;

            System.out.print("Case #"+(i+1)+": ");
     //      System.out.println("A is " + A + ",M is " + M);
            if (B < 10) {
                System.out.println("0");
                continue;
            }
            for (int j = A; j < B; j++) {
                String str = ((Integer) j).toString();
              //  System.out.println(str +"**");
                count +=tryRecycle(str, j, B);

            }
            System.out.println(count);
        }
      }

    private int tryRecycle(String str, int j, int b) {
        int count=0;
        for(int i=1;i<str.length();i++){
            String s2 = str.substring(str.length()-i,str.length()) + str.substring(0,str.length()-i);
            Integer i2 = Integer.valueOf(s2);
            if ((j < i2) && (i2 <= b)) {
                count++;
            }
        }
        return count;
    }


}
