package jp.funnything.competition.util;

import java.math.BigInteger;

/**
 * Utility for BigInteger
 */
public class BI {
    public static BigInteger ZERO = BigInteger.ZERO;
    public static BigInteger ONE = BigInteger.ONE;

    public static BigInteger add( final BigInteger x , final BigInteger y ) {
        return x.add( y );
    }

    public static BigInteger add( final BigInteger x , final long y ) {
        return add( x , v( y ) );
    }

    public static BigInteger add( final long x , final BigInteger y ) {
        return add( v( x ) , y );
    }

    public static int cmp( final BigInteger x , final BigInteger y ) {
        return x.compareTo( y );
    }

    public static int cmp( final BigInteger x , final long y ) {
        return cmp( x , v( y ) );
    }

    public static int cmp( final long x , final BigInteger y ) {
        return cmp( v( x ) , y );
    }

    public static BigInteger div( final BigInteger x , final BigInteger y ) {
        return x.divide( y );
    }

    public static BigInteger div( final BigInteger x , final long y ) {
        return div( x , v( y ) );
    }

    public static BigInteger div( final long x , final BigInteger y ) {
        return div( v( x ) , y );
    }

    public static BigInteger mod( final BigInteger x , final BigInteger y ) {
        return x.mod( y );
    }

    public static BigInteger mod( final BigInteger x , final long y ) {
        return mod( x , v( y ) );
    }

    public static BigInteger mod( final long x , final BigInteger y ) {
        return mod( v( x ) , y );
    }

    public static BigInteger mul( final BigInteger x , final BigInteger y ) {
        return x.multiply( y );
    }

    public static BigInteger mul( final BigInteger x , final long y ) {
        return mul( x , v( y ) );
    }

    public static BigInteger mul( final long x , final BigInteger y ) {
        return mul( v( x ) , y );
    }

    public static BigInteger sub( final BigInteger x , final BigInteger y ) {
        return x.subtract( y );
    }

    public static BigInteger sub( final BigInteger x , final long y ) {
        return sub( x , v( y ) );
    }

    public static BigInteger sub( final long x , final BigInteger y ) {
        return sub( v( x ) , y );
    }

    public static BigInteger v( final long value ) {
        return BigInteger.valueOf( value );
    }
}

import java.io.*;
import java.util.*;


class recycledNumbers{
  public static void main(String arg[]){
    System.out.println("Please Enter the name of your file");
    Scanner input = new Scanner(System.in);
    String fileName = input.next();
    recycle(fileName);
  }
  public static void recycle(String fileName){
    try{
    BufferedReader br = new BufferedReader(new FileReader(fileName));
    BufferedWriter bw = new BufferedWriter(new FileWriter("recycle.out"));
    
    int numCases = Integer.parseInt(br.readLine());
    int A=0;
    int B=0;
    String line="";
    for(int i=0; i<numCases; i++){
    line = br.readLine();
    int indexOfSpace=line.indexOf(' ');
    A=Integer.parseInt(line.substring(0,indexOfSpace));
    B=Integer.parseInt(line.substring(indexOfSpace+1));
    int count=0;
    
    for(int m=A; m<=B; m++){
      count += swap(m,B);

    }
    String ans = "Case #" + (i+1) + ": " + count;
    System.out.println(ans);
    bw.write(ans);
    bw.newLine();
    }
    br.close();
    bw.close();
    }catch(IOException e){}
  }
  
  public static int swap(int A,int B){
    String valA = A + "";
    int var_length = valA.length();
    int var_swap = var_length-1;
    String firstpart="";
    String secondpart="";
    String combine="";
    int combined=0;
    int verified=0;
    int temp=-99;
    
    for(int i=0; i<var_swap; i++){
      firstpart=valA.substring(0,var_swap-i);
      secondpart=valA.substring(var_swap-i);
      combine = secondpart + firstpart;
      combined = Integer.parseInt(combine);
      
      //System.out.println(combined);
      
      if((temp != combined) && (combined>A) && (combined<=B)){
        temp = combined;
        verified++;
      }
      
    }
    return verified;
  }
}