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 GoogleCodeJam.ed2012;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.concurrent.Semaphore;

public class QualificationC2012 {

	private String inputFile;
	private String outputFile;

	private BufferedReader reader = null;
	private BufferedWriter writer = null;
	
	
	private static int[] sollutions = null;
	private static int[][] inputs = null;
	
	private int totalSollutions = 0;
	private int currentSollution = 0;
	
	private Semaphore deathSignal = new Semaphore(0);
	private Object synchObject = new Object();
	
	/**
	 * @param args
	 * @throws Exception 
	 */
	public static void main(String[] args) throws Exception {
		QualificationC2012 qualificationC2012 = new QualificationC2012("QualificationC2012.in", "QualificationC2012.out");
		qualificationC2012.run();
	}

	private void run() throws Exception {
		openFiles();
		solve();
		closeFiles();
	}

	private void solve() throws Exception {
		long startTime = System.currentTimeMillis();
		totalSollutions = Integer.valueOf(reader.readLine());
		inputs = new int[totalSollutions][2];
		sollutions = new int[totalSollutions];
		
		for (int i = 0; i<totalSollutions; i++) {
			String[] line = reader.readLine().split(" ");
			inputs[i][0] = Integer.valueOf(line[0]);
			inputs[i][1] = Integer.valueOf(line[1]);
		}
		
		int threadNumber = Runtime.getRuntime().availableProcessors();
		
		for (int i = 0; i<threadNumber; i++) {
			Worker worker = new Worker();
			worker.start();
		}
		
		deathSignal.acquire(threadNumber);
		
		for (int i = 0; i<totalSollutions; i++) {
			writer.write("Case #"+(i+1)+": "+sollutions[i]+"\n");
		}
		long endTime = System.currentTimeMillis();
		System.out.println("Solve time = "+(endTime-startTime));
	}
	

	
	
	public QualificationC2012(String inputFile, String outputFile) {
		this.inputFile = inputFile;
		this.outputFile = outputFile;
	}
	
	private void closeFiles() {
		try {
			reader.close();
			writer.close();
		}
		catch (Exception e) {
			throw new RuntimeException();
		}

	}
	
	private void openFiles() {
		try {
			reader = new BufferedReader(new FileReader(inputFile));
			writer = new BufferedWriter(new FileWriter(outputFile));
		}
		catch (Exception e) {
			throw new RuntimeException("File initialization failed");
		}
	}
	
	private class Worker extends Thread {
		private int[] foundValues = new int[6];	
	
		
		public Worker() {
			
		}
		
		public void run() {
			while (true){
				int currentInput = 0; 
				synchronized (synchObject) {
					currentInput = currentSollution;
					currentSollution++;
					if (currentInput >= totalSollutions) {
						break;
					}
				}
				int a = inputs[currentInput][0];
				int b = inputs[currentInput][1];
				int sum = 0;
				for (int i=a; i<b; i++) {
					sum+=getValidPairs(i,b);
				}
				sollutions[currentInput] = sum;
			}
			deathSignal.release();
		}
		
		private int getValidPairs(int j, int b) {
			int validPairs = 0;
			StringBuilder transformedString = new StringBuilder();
			transformedString.append(j);
			int length = transformedString.length();
			transformedString.append(j);
			
			for (int i=1; i<length; i++) {
				int transformed = Integer.valueOf(transformedString.substring(i, i+length));
				if ((j<transformed) && (transformed<=b) && (!found(transformed,validPairs))) {
					foundValues[validPairs] = transformed;
					validPairs++;
				}
			}
			return validPairs;
		}

		private boolean found(int n, int total) {
			for (int i=0; i<total; i++) {
				if (foundValues[i] == n) {
					return true;
				}
			}
			return false;
		}
	}
}
