import java.util.*;
import java.lang.*;
import java.math.*;
import java.io.*;

import static java.lang.Math.*;
import static java.util.Arrays.*;
import static java.util.Collections.*;

public class C{
	Scanner sc=new Scanner(System.in);

	int INF=1<<28;
	double EPS=1e-9;

	int caze, T;
	int A, B;

	void run(){
		T=sc.nextInt();
		for(caze=1; caze<=T; caze++){
			A=sc.nextInt();
			B=sc.nextInt();
			solve();
		}
	}

	void solve(){
		int ans=0;
		for(int n=A; n<=B; n++){
			int digit=(int)(log10(n)+EPS);
			int d=(int)pow(10, digit);
			// debug("n", n);
			for(int m=rot(n, d); m!=n; m=rot(m, d)){
				// debug("m", m);
				if(n<m&&m<=B){
					ans++;
				}
			}
		}
		answer(ans+"");
	}

	int rot(int n, int d){
		return n/10+n%10*d;
	}

	void answer(String s){
		println("Case #"+caze+": "+s);
	}

	void println(String s){
		System.out.println(s);
	}

	void print(String s){
		System.out.print(s);
	}

	void debug(Object... os){
		System.err.println(deepToString(os));
	}

	public static void main(String[] args){
		try{
			System.setIn(new FileInputStream("dat/C-small.in"));
			System.setOut(new PrintStream(new FileOutputStream("dat/C-small.out")));
		}catch(Exception e){}
		new C().run();
		System.out.flush();
		System.out.close();
	}
}

package fixjava;

import java.util.concurrent.Callable;
import java.util.concurrent.CompletionService;
import java.util.concurrent.ExecutionException;
import java.util.concurrent.ExecutorCompletionService;
import java.util.concurrent.ExecutorService;
import java.util.concurrent.Executors;

/**
 * A work queue that allows the work queue to continue to increase in size if it is discovered that subdivision of work is
 * necessary. Call hasIdleWorkers() to see if there are idle workers, and have the worker subdivide their work further by calling
 * enqueueWork().
 */
public class ParallelWorkQueueDynamic {

	private int numThreads;
	private ExecutorService threadPool;
	private CompletionService<Void> completionService;

	private int numWorkUnitsEnqueued = 0;
	private Object lock = new Object();

	public ParallelWorkQueueDynamic(int numThreads) {
		this.numThreads = numThreads;
		threadPool = Executors.newFixedThreadPool(numThreads);
		completionService = new ExecutorCompletionService<Void>(threadPool);
	}

	/**
	 * Enqueue work. Called by the main thread to start processing, and can also be called by workers to subdivide their work.
	 */
	public void enqueueWork(Callable<Void> workUnit) {
		synchronized (lock) {
			numWorkUnitsEnqueued++;
		}
		completionService.submit(workUnit);
	}

	/**
	 * Test if there are any idle workers. Should only be called from within a worker so that the total number of workers is greater
	 * than zero (to avoid a race).
	 */
	public boolean hasIdleWorkers() {
		return numWorkUnitsEnqueued < numThreads;
	}

	/**
	 * Wait for all work submitted by workers to be completed. Throws IllegalArgumentException if any of the worker threads throw an
	 * exception (this causes an ExecutionException).
	 */
	public void waitForAllWorkersToQuit() {
		try {
			while (numWorkUnitsEnqueued > 0) {
				// .take() waits for completion of next task and returns a Future for it
				completionService.take().get();
				synchronized (lock) {
					numWorkUnitsEnqueued--;
				}
			}
		} catch (InterruptedException e) {
			e.printStackTrace();
			throw new IllegalArgumentException("waitForAllWorkersToQuit() failed with " + e.getMessage(), e);
		} catch (ExecutionException e) {
			e.printStackTrace();
			throw new IllegalArgumentException("waitForAllWorkersToQuit() failed with " + e.getMessage(), e);
		}
	}

	public void shutdown() {
		threadPool.shutdown();
	}
}
