import java.io.*;

class code1
{
	public static void main(String args[]) throws Exception 
	{
		File ii = new File ("C-small-attempt1.in");
		FileInputStream fis = new FileInputStream(ii);
		BufferedReader  br = new BufferedReader(new InputStreamReader (fis));
		int cases = Integer.parseInt(br.readLine());
		FileOutputStream fout = new FileOutputStream ("output.txt");
		DataOutputStream dout = new DataOutputStream (fout);
		int total=0;
		for(int i=0;i<cases;i++){
		String temp = br.readLine();
		String parts [] = temp.split(" ");
		int lower = Integer.parseInt(parts[0]);
		int upper = Integer.parseInt(parts[1]);
		System.out.println(lower+" "+upper);
		
		for(int j=lower;j<=upper;j++)
		{
			int abc = j;int length=0;
			if(j<10)continue;
			while (abc!=0){abc/=10;length++;}
			abc=j;
			for(int m=0;m<length-1;m++){
				int shift = abc%10;
				abc=abc/10;
				System.out.println("hi "+j);
				abc=abc+shift*power(10,length-1);
				if(abc<=upper&&shift!=0&&abc>j)total++;
				System.out.println(total);
			}
		}
 		dout.writeBytes("Case #"+(i+1)+ ": "+total+"\n");
 		total=0;
		}//for close
		
	}

	private static int power(int i, int j) {
		int no=1;
		for(int a=0;a<j;a++){no=10*no;}
		return no;
	}
}
/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package codejam.y12.round0;

import utils.Jam;
import utils.JamCase;

/**
 *
 * @author fabien
 */
public class RecycledNumbers extends Jam {

  public RecycledNumbers(String filename) {
    super(filename);
  }

  @Override
  public JamCase getJamCase(int number) {
    return new Line(this, number, lines[number]);
  }

  private class Line extends JamCase {

    private int a;
    private int b;
    private String line;
    private int count;

    public Line(Jam parent, int number, String line) {
      super(parent, number);
      this.line = line;
    }

    @Override
    public void parse() {
      String[] integers = line.split(" ");
      a = Integer.parseInt(integers[0]);
      b = Integer.parseInt(integers[1]);
    }

    @Override
    public void solve() {
      count = 0;
      for (int i = a; i <= b; i++) {
        countRecycles(i);
      }
      result = Integer.toString(count);
    }

    private void countRecycles(int number) {
      int len = 0;
      int n = number;
      while (n != 0) {
        n /= 10;
        len++;
      }
      n = number;
      int exp = (int) Math.pow(10, len - 1);
      for (int i = 0; i < len; i++) {
        n = nextRecycled(n, exp);
        if (n == number) {
          return;
        }
        if (n <= b && n > number) {
          count++;
        }
      }
    }

    private int nextRecycled(int i, int exp) {
      int r = i % 10;
      i = (i - r) / 10;
      i += r * exp;
      return i;
    }
  }
}
