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 org.mikeyin;

import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintStream;
import java.util.HashSet;
import java.util.Scanner;

/**
 * @author yincrash
 *
 */
public class RecycledNumbers
{
  // from stackoverflow, exponentiation by squaring
  public static int ipow(int base, int exp)
  {
      int result = 1;
      while (exp != 0)
      {
          if ((exp & 1) != 0)
              result *= base;
          exp >>= 1;
          base *= base;
      }

      return result;
  }
  

  /**
   * @param args
   */
  public static void main(String[] args)
  {

    try
    {
      Scanner file = new Scanner(new File(args[0]));
      int testCases = file.nextInt();
      file.nextLine();
      int currentCase = 1;
      final PrintStream ps = new PrintStream(new File("numbers.out"));
      while (currentCase <= testCases) {
        final int a = file.nextInt();
        final int b = file.nextInt();
        
        ps.append("Case #").print(currentCase);
        ps.append(": ");        
        ps.println(numRecycled(a, b));
        
        currentCase++;
      }
    } catch (FileNotFoundException e)
    {
      e.printStackTrace();
    }
  }
  
  private static class Pair {
    private int n,m;
    public Pair(int n, int m) {
      this.n = n;
      this.m = m;
    }
    @Override
    public int hashCode()
    {
      final int prime = 31;
      int result = 1;
      result = prime * result + m;
      result = prime * result + n;
      return result;
    }
    @Override
    public boolean equals(Object obj)
    {
      if (this == obj)
        return true;
      if (obj == null)
        return false;
      if (getClass() != obj.getClass())
        return false;
      Pair other = (Pair) obj;
      if (m != other.m)
        return false;
      if (n != other.n)
        return false;
      return true;
    }
    @Override
    public String toString()
    {
      return new StringBuilder("(").append(n).append(',').append(m).append(')').toString();
    }
  }

  private static int numRecycled(int a, int b)
  {
    HashSet<Pair> recycledPairs = new HashSet<Pair>(); 
    for (int i = a; i < b; i++) {
      int numDigits = (int) (Math.floor(Math.log10(i))) + 1;
      int current = i;
      for (int j = 0; j < numDigits - 1; j++) {
        int digit = current % 10;
        current = current / 10 + (digit * ipow(10, (numDigits - 1)));
        if (current > i && current <= b)
          recycledPairs.add(new Pair(i, current));
      }
    }
    return recycledPairs.size();
  }
}
