import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

class RecycledNumbers{
	
	
	
	int getcount(int small,int large){
		int count = 0;
		for(int currnum = small; currnum < large; currnum++){
			int permut = currnum;
			int no_of_digits = 0;
			while(permut > 0){
				permut = permut/10;
				no_of_digits++;
			}
			int lastDigit = currnum % 10;
			permut = currnum / 10;
			permut = permut + lastDigit * (int)Math.pow(10, no_of_digits-1);
			while(permut != currnum){
				
				if(permut >= currnum && permut <= large){
					
					count++;
				}
				lastDigit = permut % 10;
				permut = permut / 10;
				permut = permut + lastDigit * (int)Math.pow(10, no_of_digits-1);
				
			}
			
		}
		
		return count;
	}
	
	public static void main(String args[]){
		RecycledNumbers d = new RecycledNumbers();
		
		int no_of_cases = 0;
		String input = "";
		
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		try{
			no_of_cases = Integer.parseInt(br.readLine());
		}
		catch(Exception e){
			System.out.println("First line is not a number");
		}
		
		for(int i=1; i <= no_of_cases;i++){
			try{
				input = br.readLine();
			}
			catch(Exception e){
				System.out.println("Number of test cases different from the number mentioned in first line");
			}
			
			System.out.print("Case #" +i+": ");
			
			StringTokenizer t =  new StringTokenizer(input);
			int small=0,large=0;
			if(t.hasMoreTokens()){
				small = Integer.parseInt(t.nextToken());
			}
			if(t.hasMoreTokens()){
				large = Integer.parseInt(t.nextToken());
			}
			System.out.println(d.getcount(small,large));
			
		}
		
		
		

	}
	
	
}
package MyAllgoritmicLib;

public class Hungary {

	int INF = 1000*1000*1000;

	int n;
	int[][] a;
	int[] xy, yx;
	boolean[] vx, vy;
	int[] minrow, mincol;

	public Hungary(int[][] a) {
		// TODO Auto-generated constructor stub
		this.a = a.clone();
	}
	
	private boolean dotry (int i) {
		if (vx[i])  return false;
		vx[i] = true;
		for (int j=0; j<n; ++j)
			if (a[i][j]-minrow[i]-mincol[j] == 0)
				vy[j] = true;
		for (int j=0; j<n; ++j)
			if (a[i][j]-minrow[i]-mincol[j] == 0 && yx[j] == -1) {
				xy[i] = j;
				yx[j] = i;
				return true;
			}
		for (int j=0; j<n; ++j)
			if (a[i][j]-minrow[i]-mincol[j] == 0 && dotry (yx[j])) {
				xy[i] = j;
				yx[j] = i;
				return true;
			}
		return false;
	}
	
	@SuppressWarnings("unused")
	private int hungary(int num) {
		mincol = new int[num];
		minrow = new int[num];
		xy = new int[num];
		yx = new int[num];
		vx = new boolean[num];
		vy = new boolean[num];

        n = num;
        for (int q = 0; q<n; q++) {
        	mincol[q] = INF;
        	minrow[q] = INF;
        }

		for (int i=0; i<n; ++i)
			for (int j=0; j<n; ++j)
				minrow[i] = Math.min(minrow[i], a[i][j]);
		for (int j=0; j<n; ++j)
			for (int i=0; i<n; ++i)
				mincol[j] = Math.min (mincol[j], a[i][j] - minrow[i]);

        for (int q = 0; q<n; q++) {
        	xy[q] = -1;
        	yx[q] = -1;
        }

		for (int c=0; c<n; ) {
	        for (int q = 0; q<n; q++) {
	        	vx[q] = false;
	        	vy[q] = false;
	        }
			int k = 0;
			for (int i=0; i<n; ++i)
				if (xy[i] == -1 && dotry (i))
					++k;
			c += k;
			if (k == 0) {
				int z = INF;
				for (int i=0; i<n; ++i)
					if (vx[i])
						for (int j=0; j<n; ++j)
							if (!vy[j])
								z = Math.min (z, a[i][j]-minrow[i]-mincol[j]);
				for (int i=0; i<n; ++i) {
					if (vx[i]) minrow[i] += z;
					if (vy[i]) mincol[i] -= z;
				}
			}
		}

		int ans = 0;
		for (int i=0; i<n; ++i)
			ans += a[i][xy[i]];
		return ans;
	}
}
