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 com.evolve.codejam2012.qualification;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Set;
import java.util.StringTokenizer;

class Pair {
	private long a;
	private long b;

	Pair(long a, long b) {
		if (a > b) {
			this.b = a;
			this.a = b;
		} else {
			this.a = a;
			this.b = b;
		}
	}

	public long getA() {
		return a;
	}

	public long getB() {
		return b;
	}

	@Override
	public int hashCode() {
		final int prime = 31;
		int result = 1;
		result = prime * result + (int) (a ^ (a >>> 32));
		result = prime * result + (int) (b ^ (b >>> 32));
		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 (a != other.a)
			return false;
		if (b != other.b)
			return false;
		return true;
	}


	
	
}

public class Recycled {

	private static final String TEST_FILE = "C-large.in";
	private PrintWriter pw = null;
	private BufferedReader br = null; 		
	
	Recycled(boolean skip) throws IOException {
		String outFile = TEST_FILE.replace(".in", ".out");
		//System.out.println(outFile);
		this.pw = new PrintWriter(new FileWriter(outFile));
		if (skip)
			return;
		
		File file = new File(TEST_FILE);
		if (file.exists()) {
			br = new BufferedReader(new java.io.FileReader(TEST_FILE));
		} else {
			br = new BufferedReader(new InputStreamReader(System.in), 1 << 16);
		}
	}	
	
	void doit() throws NumberFormatException, IOException {
		int testsNumber = Integer.parseInt(br.readLine());
		
		System.out.println(testsNumber);
		
		for (int i = 1; i <= testsNumber; i++) {
			StringTokenizer st = new StringTokenizer(br.readLine());
			
			long A = Long.parseLong(st.nextToken());
			long B = Long.parseLong(st.nextToken());
			
			System.out.println(A + " " + B);
			
			long num = check(A, B);
			
			System.out.println(num);
			
			pw.println("Case #" + i + ": " + num);
		}
		pw.flush();
		pw.close();
	}
	
	int check(final long A, final long B) {
		//Set<Pair> set = new HashSet<Pair>();
		
		int counter = 0;
		
		for (long n = A; n < B; n++) {
			String str = Long.toString(n);
			
			// ile rotacji: str.length - 1
			int rotations = str.length() - 1;
			
			for (int j = 0; j < rotations; j++) {
				str = rotate(str);
				
				// skip numbers starting with 0: 
				if (str.startsWith("0")) {
					continue;
				}
				
				// construct new number:
				long m = Long.parseLong(str);
				
				// check: n < m
				if (!(n < m)) {
					continue;
				}
				
				// check m <= B
				if (m > B) {
					continue;
				}
				
				
				//Pair pair = new Pair(n, m);
				//set.add(pair);
				
				counter++;
				
				//System.out.println(n + ", " + m);
			}
			//System.out.println(str);
		}
		return counter;
	}
	
	static String rotate(String str) {
		char ch = str.charAt(str.length() - 1);
		char[] arr = new char[1];
		arr[0] = ch;
		return new String(arr).concat(str.substring(0, str.length() - 1));
	}
	
	public static void main(String[] args) throws NumberFormatException, IOException {
		//System.out.println(rotate("1"));
		
		new Recycled(false).doit();

	}


}
