import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;


public class Main {

//	static int MAX = 10000;
	static int MAX = 2000000;
	static Object[] All = new Object[MAX+1];
	
	static int size( int x ) {
		if(x>999999) return 7;
		if(x>99999)  return 6;
		if(x>9999)   return 5;
		if(x>999)    return 4;
		if(x>99)     return 3;
		if(x>9)      return 2;
		return 1;
	}
	static int[] rotate( int value ) {
		List<Integer> result = new ArrayList<Integer>();
		int[] V = new int[8];
		int s = size(value);
		int x = value;
		
		for(int i=s-1;i>=0;i--) {
			V[i] = x%10;
			x /=10;
		}
		int rot;
		for(int i=1; i<s; i++) {
			if(V[i]!=0){
				rot=0;
				for(int j=0,ii=i;j<s; j++,ii=(ii+1)%s){
					rot=rot*10+V[ii];
				}
				if(rot>value && !result.contains(rot))
					result.add(rot);
			}
		}
		if( result.isEmpty() )
			return null;
		int[] r = new int[result.size()];
		for(int i=0; i<r.length; i++)
			r[i]=result.get(i);
		return r;
	}
	
	static void precalculate() {
		for(int i=1; i<=MAX; i++){
			All[i] = rotate(i);
		}
	}
	static int solve( Scanner in ) {
		int A, B, sol=0;
		
		A = in.nextInt();
		B = in.nextInt();

		for( int i=A; i<=B; i++) {
//			List<Integer> result = rotate(i);
			if( All[i]!=null ) {
				for(int value: (int[])All[i] ) {
					if( value <= B )
						sol++;
				}
			}
		}

		return sol;
	}
	
	public static void main ( String args[] ) {
		int T; 
		Scanner in = new Scanner(System.in);
		T = in.nextInt();
		int cnt=0;
		int sol;
		precalculate();
		for( cnt=1; cnt<=T; cnt++ ) {
			sol = solve( in );
			System.out.printf("Case #%d: %d\n", cnt, sol);
		}

	}
}

package de.pat.dev.y2012.qualification.c;

import java.util.*;

/**
 * @author pat.dev@alice.de
 */
public class RecycledNumber {
  private final long lower;
  private final long upper;
  private final long rotationFactor;

  public RecycledNumber(long lower, long upper) {
    this.lower = lower;
    this.upper = upper;
    int numberOfDigits = String.valueOf(lower).length();
    rotationFactor = rotationFactor(numberOfDigits);
  }

  private long rotationFactor(int numberOfDigits) {
    long factor = 1;
    for (int i = 1; i < numberOfDigits; i++) {
      factor *= 10;
    }
    return factor;
  }

  public Set<Pair> pairs() {
    Set<Pair> pairs = new HashSet<Pair>();
    for (long number = lower; number <= upper; number++) {
      Set<Long> rotations = rotations(number);
      for (Long rotation : rotations) {
        pairs.add(new Pair(number, rotation));
      }
    }
    return pairs;
  }

  public Set<Long> rotations(long number) {
    if (rotationFactor == 1) {
      return Collections.emptySet();
    }

    Set<Long> rotations = new HashSet<Long>();
    long rotation = rotate(number);
    while (rotation != number) {
      if (rotation > number && rotation <= upper) {
        rotations.add(rotation);
      }
      rotation = rotate(rotation);
    }
    return rotations;
  }

  private long rotate(long number) {
    long lastDigit = number % 10;
    return number / 10 + lastDigit * this.rotationFactor;
  }

  public static final class Pair {
    public final long m;
    public final long n;

    public Pair(long m, long n) {
      this.m = m;
      this.n = n;
    }

    @Override
    public String toString() {
      return "Pair{" +
        "m=" + m +
        ", n=" + n +
        '}';
    }

    @Override
    public boolean equals(Object o) {
      if (this == o) return true;
      if (!(o instanceof Pair)) return false;

      Pair pair = (Pair) o;

      if (m != pair.m) return false;
      if (n != pair.n) return false;

      return true;
    }

    @Override
    public int hashCode() {
      int result = (int) (m ^ (m >>> 32));
      result = 31 * result + (int) (n ^ (n >>> 32));
      return result;
    }
  }
}
