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.io.File;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.Set;

import com.google.common.base.Charsets;
import com.google.common.base.Predicate;
import com.google.common.collect.ArrayListMultimap;
import com.google.common.collect.Collections2;
import com.google.common.collect.HashMultimap;
import com.google.common.collect.Multimap;
import com.google.common.io.Files;

public class Main {
  
  public static void main(String[] args) throws IOException {

//    File f = new File("C-small-attempt0.in");
    File f = new File("C-small-attempt1.in");
//    File f = new File("C-small-attempt2.in");
//    File f = new File("C-large.in");
//    File f = new File("B-large.in");
//    File f = new File("A-large-practice.in");
//    File f = new File("example.in");
//    File f = new File("test.in");
    List<String> lines = Files.readLines(f, Charsets.UTF_8);

    int cases = Integer.valueOf(lines.get(0));
    int c = 0;
    while (c < cases) {
      int result = 0;
      c++;
      String[] tokens = lines.get(c).split(" ");
      int a = Integer.valueOf(tokens[0]);
      int b = Integer.valueOf(tokens[1]);
      
      Set<Integer> set = new HashSet<Integer>();
      for(int n = a; n < b; n++) {
        set.clear();
        String s = "" + n;
//        System.out.println(" >> " + s);
        int sl = s.length();
        for (int i = 0; i < sl; i++) {
          Integer shifted = shift(s, i);
          if (shifted != null && shifted <= b && shifted > n) {
//            System.out.println(shifted);
            set.add(shifted);
          }
        }
        result += set.size();
      }
      
      System.out.println("Case #" + c + ": " + result);
    }
  }

  private static Integer shift(String n, int i) {
    i++;
    int l = n.length();
    String s = n.substring(l - i, l) + n.substring(0,l - i);
    if (s.compareTo(n) <= 0) {
      return null;
    } else {
      return Integer.valueOf(s);
    }
  }

}