package codejam;

import java.util.*;
import java.io.*;

public class RecycledNumbers {
	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new FileReader("in.txt"));
		PrintWriter out = new PrintWriter(new File("out.txt"));
		
		int T = Integer.parseInt(in.readLine());
		for (int t = 1; t <= T; ++t) {
			String[] parts = in.readLine().split("[ ]+");
			int A = Integer.parseInt(parts[0]);
			int B = Integer.parseInt(parts[1]);
			
			int cnt = 0;
			for (int i = A; i < B; ++i) {
				String str = String.valueOf(i);
				int n = str.length();
				String res = "";
				Set<Integer> seen = new HashSet<Integer>();
				for (int j = n - 1; j > 0; --j) {
					res = str.substring(j) + str.substring(0, j);
					int k = Integer.parseInt(res);
					if (k > i && k <= B) {
						//System.out.println("(" + i + ", " + k + ")");
						if (!seen.contains(k)) {
							++cnt;
							seen.add(k);
						}
					}
				}
			}

			out.println("Case #" + t + ": " + cnt);
		}
		
		in.close();
		out.close();
		System.exit(0);
	}
}

import java.util.Scanner;
import java.io.*;

public class Google2 {
  public static void main(String[] args) throws IOException {
    Scanner kb = new Scanner(new File("c:/A-small-attempt0.in"));
//    Scanner kb = new Scanner(System.in);
    int num = kb.nextInt();
    for (int i = 0; i < num; i++) {
      int a = kb.nextInt();
      int b = kb.nextInt();
      int count = 0;
      for (int j = a; j < b; j++) {
        for (int k = j + 1; k <= b; k++) {
          //System.out.println("++++ "+j + " " + k + " ");
          if (isRecycled(j, k)) {
            count++;
            //System.out.print(count);
          }
          //System.out.println();
        }
      }
      System.out.println("Case #" + (i + 1) + ": " + count);
    }
  }
  public static boolean isRecycled(int a, int b) {
    String n = a + "";
    String m = b + "";
    int numLength = n.length();
    for (int i = 1; i < numLength; i++) {
      if (n.substring(0, i).equals(m.substring(numLength - i, numLength)) && n.substring(i, numLength).equals(m.substring(0, numLength - i))) {
        //System.out.println(" true");
        return true;
      }
    }
    return false;
  }
}

