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.util.*;

class Recycle{
  public static void main(String[] args){
    Scanner sc = new Scanner(System.in);
    int testcase, A, B;
    testcase = sc.nextInt();
    for(int i=1;i<=testcase;i++){
      A = sc.nextInt();
      B = sc.nextInt();
      System.out.println("Case #"+i+": "+countpair(A,B));
    }
  }
  
  public static int countpair(int A, int B){
    int numdigit, temp = A, temp2, counter;
    int[] remember;
    counter = 0;
    while(A<=B){
      remember = new int[7];
     numdigit = (int)Math.log10((double)A) + 1;
     temp = A;
     for(int i=0;i<numdigit;i++){
       temp2 = temp%10;
       temp/=10;
       temp+=temp2*(int)Math.pow(10,numdigit-1);

       if(check(temp, A, B, remember)){
         counter++;
       }
     }
     A++;
    }
    return counter;
  }
  
  public static boolean check(int checker, int A, int B, int[] remember){
    boolean checked = false;
    boolean alreadyhave = false;
    int i = 0;
      if(checker> A && checker<=B){
        for(i=0;i<remember.length;i++){
          if(remember[i] == checker){
            alreadyhave = true;
            break;
          }
        }
        if(!alreadyhave){
          i=0;
          while(remember[i]!=0)
            i++;
          remember[i] = checker;
          checked = true;
        } 
      }
    return checked;

  }
}
  