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.util.ArrayList;
import java.util.Scanner;

public class recycled
{
  public static void main(String[] args)
  {
    Scanner in = new Scanner (System.in);
    String scases = in.nextLine(); 
    int T = Integer.parseInt(scases);
    for(int i = 1; i<(T+1); i++)
    {
      String temp1 = in.nextLine();
      String[] temp2 = temp1.split(" ");
      int low = Integer.parseInt(temp2[0]); 
      int high = Integer.parseInt(temp2[1]);
      int count = 0;
      ArrayList<String> checked = new ArrayList<String>();
      for(int test = low; test < high; test++)
      {
	String stest = Integer.toString(test);
	int len = stest.length();
	for(int pos = 1; pos < (len) ; pos++)
	{
	  String scheck = "";
	  scheck += stest.charAt(len-1);
	  scheck += stest.substring(0,len-1);
	  stest = scheck;
	  int check = Integer.parseInt(scheck);

	    if(check > test && check <= high)
	    {
	      count = count +1;
	      checked.add(scheck);
	    }

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

}
