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));
	}
}

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

public class Recycled {

  public static void main(String[] args) {
    Recycled d = new Recycled();
    d.run();
  }

  public Recycled() {}


  public boolean isRecyclable(int n, int m) {
    boolean result = false;
    String mStr = m + "";
    String nStr = n + "";

    if (mStr.length() == 1) {
        return result;
    } 


    for (int i = 1; i < mStr.length(); i++) {
        String newM = mStr.substring(i) + mStr.substring(0, i);
        if (newM.equals(nStr)) {
            result = true;
            break;
        }
    }

    return result;
  }


  public void run() {
    Scanner sc = new Scanner(System.in);
    int testCases = sc.nextInt();

    for (int i = 0; i < testCases; i++) {
      int a = sc.nextInt();
      int b = sc.nextInt();

      int n = 0;
      int m = 0;

      int recyclable = 0;
      for (n = a; n < b; n++) {
        for (m = n+1; m <= b; m++) {
           if (isRecyclable(n, m)) {
             recyclable++;
           }
        }
      }

      System.out.println("Case #" + (i+1) + ": " + recyclable);
    }
  }
}

