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 fixjava;

import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Map.Entry;
import java.util.Set;

/**
 * Simple multimap class. <code>
  
  		MultiMap<String, String> map = MultiMapKeyToList.make();
		map.put("a", "x");
		map.put("a", "x");
		map.put("a", "y");
		map.put("b", "z");
		System.out.println(Join.joinRecursive(map.entrySet(), ", ", "[", "]"));
		
  </code>
 * 
 * @author luke
 */
public class MultiMapKeyToList<S, T> {

	HashMap<S, ArrayList<T>> map = new HashMap<S, ArrayList<T>>();

	public static <K, V> MultiMapKeyToList<K, V> make() {
		return new MultiMapKeyToList<K, V>();
	}

	public void put(S key, T value) {
		ArrayList<T> list = map.get(key);
		if (list == null) {
			list = new ArrayList<T>();
			map.put(key, list);
		}
		list.add(value);
	}

	public ArrayList<T> get(S key) {
		return map.get(key);
	}

	public boolean containsKey(S key) {
		return map.containsKey(key);
	}

	public int sizeKeys() {
		return map.size();
	}

	public HashSet<T> valuesUnion() {
		HashSet<T> result = new HashSet<>();
		for (Entry<S, ArrayList<T>> ent : map.entrySet())
			for (T val : ent.getValue())
				result.add(val);
		return result;
	}

	public Set<Entry<S, ArrayList<T>>> entrySet() {
		return map.entrySet();
	}

	public HashMap<S, ArrayList<T>> getRawMap() {
		return map;
	}

	public ArrayList<Pair<S, ArrayList<T>>> getRawMapAsList() {
		ArrayList<Pair<S, ArrayList<T>>> result = new ArrayList<Pair<S, ArrayList<T>>>();
		for (Entry<S, ArrayList<T>> ent : map.entrySet())
			result.add(Pair.make(ent.getKey(), ent.getValue()));
		return result;
	}

	public void putAll(S key, Iterable<T> values) {
		boolean putSomething = false;
		for (T val : values) {
			put(key, val);
			putSomething = true;
		}
		if (!putSomething && !map.containsKey(key))
			// If putting an empty collection, need to create an empty set at the key 
			map.put(key, new ArrayList<T>());
	}

	public void putAll(S key, T[] values) {
		if (values.length == 0 && !map.containsKey(key))
			// If putting an empty collection, need to create an empty set at the key 
			map.put(key, new ArrayList<T>());
		else
			for (T val : values)
				put(key, val);
	}

	/** Invert the mapping */
	public MultiMapKeyToList<T, S> invert() {
		MultiMapKeyToList<T, S> inv = new MultiMapKeyToList<T, S>();
		for (Entry<S, ArrayList<T>> ent : map.entrySet()) {
			S s = ent.getKey();
			for (T t : ent.getValue())
				inv.put(t, s);
		}
		return inv;
	}

	public ArrayList<Pair<S, ArrayList<T>>> toList() {
		ArrayList<Pair<S, ArrayList<T>>> result = new ArrayList<Pair<S, ArrayList<T>>>();
		for (Entry<S, ArrayList<T>> ent : map.entrySet())
			result.add(Pair.make(ent.getKey(), ent.getValue()));
		return result;
	}

	/** Write out to a TSV file */
	public void writeOutToFile(String tsvFile) throws IOException {
		PrintWriter writer = new PrintWriter(tsvFile);
		for (Entry<S, ArrayList<T>> ent : map.entrySet()) {
			S key = ent.getKey();
			StringBuilder buf = new StringBuilder();
			buf.append(key);
			for (T val : ent.getValue())
				buf.append("\t" + val);
			writer.println(buf.toString());
		}
		writer.close();
	}

	/** Read in a String->String map from a TSV file */
	public static MultiMapKeyToList<String, String> readFromFile(String tsvFile) throws IOException {
		MultiMapKeyToList<String, String> map = new MultiMapKeyToList<String, String>();
		for (String line : new FileLineIterator(tsvFile)) {
			String[] parts = Split.split(line, "\t");
			String key = parts[0];
			for (int i = 1; i < parts.length; i++)
				map.put(key, parts[i]);
		}
		return map;
	}

}
