import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;

public class CopyOfCopyOfMain {

	static int ndigits(int n) {
		return (int) (Math.log10(n) + 1);
	}

	static int rot(int n, int dig) {
		return (int) ((n % 10) * Math.pow(10, dig - 1)) + (int) (n / 10);
	}

	public static void main(String[] args) throws FileNotFoundException {
		String file = "C-large";
		Scanner in = new Scanner(new File(file + ".in"));
		PrintWriter out = new PrintWriter(new File(file + ".out"));

		int T = in.nextInt();
		for (int t = 1; t <= T; t++) {
			int A = in.nextInt();
			int B = in.nextInt();

			int c = 0;
			int[] list = new int[ndigits(B)];
			numbers: for (int i = A; i <= B; i++) {
				int digs = ndigits(i);
				int rot = i;
				int pairs = 0;

				Arrays.fill(list, -1);
				list[0] = i;

				digits: for (int j = 1; j <= digs + 1; j++) {

					rot = rot(rot, digs);
					if(rot < i)
						continue;

					if (A <= rot && rot <= B) {
						for (int k = 0; k < j; k++) {
							if (list[k] == rot) {
								continue digits;
							}
						}
						pairs++;
						list[j] = rot;
					}
				}

				//c += pairs * (pairs + 1) / 2;
				c += pairs ;
				// c+=digs;
			}
			out.println("Case #" + t + ": " + c);
		}

		in.close();
		out.close();
	}
}

import java.io.*;
import java.util.*;
public class Q3{
  public static void main(String args[]){
    try {
      BufferedReader is = new BufferedReader(
        new InputStreamReader(new FileInputStream(new File("C-large.in"))));
      BufferedWriter os = new BufferedWriter(
        new OutputStreamWriter(new FileOutputStream(new File("q3output-l.txt"))));

      int num = Integer.parseInt(in(is));

      for (int i=0;i<num;i++){
        String s = in(is);

        
        String o = answer(s);


        p("Case #" + (i + 1) + ": " + o, os);

      }
      is.close();
      os.close();
    }catch(Exception e){
      e.printStackTrace();
    }
  }

  private static String in(BufferedReader is) throws IOException{
    return is.readLine();
  }

  private static void p(String n, String w){
    System.out.println(n + ":" + w);
  }

  private static void p(String w) {
    System.out.println(w);
  }

  private static void p(int w) {
    p(""+w);
  }

  private static void p(String w, BufferedWriter os) throws IOException{
    os.write(w);
    os.newLine();
  }

  private static String answer(String s) {
    StringTokenizer sb = new StringTokenizer(s);
    int result = 0;
    int min = Integer.parseInt(sb.nextToken());
    int max = Integer.parseInt(sb.nextToken());
    int border = first(max);
    
    for (int i=min;i<=max;i++){
    	result += pair(i, border, max);
    }
    return ""+result;
  }

  private static int pair(int i, int border, int max){
    int result = 0;
    int first = first(i);
    int num = i;
    int target = 0;
    int out = 0;
    Set<Integer> dup = new HashSet<Integer>();
    while(num >= 10 ) {
      target = num % 10;
      num = num/10;
      out++;
      int convert = convert(num, i, out);
      if (target > first && target < border) {
        if(!dup.contains(convert)){
          dup.add(convert);
          result++;
        }
      } else if(target == first && target == border) {
        if(!dup.contains(convert) && compare(convert, i) && !compare(convert, max)){
          dup.add(convert);
          result++;
        }
      } else if(target == first) {
        if(!dup.contains(convert) && compare(convert, i) && !compare(convert, max)){
          dup.add(convert);
          result++;
        }
      } else if(target == border) {
        if(!dup.contains(convert) && compare(convert, i) && !compare(convert, max)){
          dup.add(convert);
          result++;
        }
      }
    }
    return result;
  }

  private static int first(int num){
    int ret = num;
    while(ret >= 10) {
      ret = ret/10;
    }
    return ret;
  }

  private static int convert(int num, int all, int out){
    int m = power(out);
    int p = digits(num);
    return (all - num * m) * p + num;
  }

  private static boolean compare(int n, int com){
    return n > com;
  }

  private static int digits(int num){
    int ret = 10;
    while(num >= 10) {
      num = num/10;
      ret*=10;
    }
    return ret;
  }

  private static int power(int out){
    int ret = 1;
    for(int i =0;i<out;i++){
      ret *= 10;
    }
    return ret;
  }
}

