/*
 * Problem C. Recycled Numbers
 * 
 * Do you ever become frustrated with television because you keep seeing the
 * same things, recycled over and over again? Well I personally don't care about
 * television, but I do sometimes feel that way about numbers.
 * 
 * Let's say a pair of distinct positive integers (n, m) is recycled if you can
 * obtain m by moving some digits from the back of n to the front without
 * changing their order. For example, (12345, 34512) is a recycled pair since
 * you can obtain 34512 by moving 345 from the end of 12345 to the front. Note
 * that n and m must have the same number of digits in order to be a recycled
 * pair. Neither n nor m can have leading zeros.
 * 
 * Given integers A and B with the same number of digits and no leading zeros,
 * how many distinct recycled pairs (n, m) are there with A â¤ n < m â¤ B?
 * 
 * Input
 * 
 * The first line of the input gives the number of test cases, T. T test cases
 * follow. Each test case consists of a single line containing the integers A
 * and B.
 * 
 * Output
 * 
 * For each test case, output one line containing "Case #x: y", where x is the
 * case number (starting from 1), and y is the number of recycled pairs (n, m)
 * with A â¤ n < m â¤ B.
 * 
 * Limits
 * 
 * 1 â¤ T â¤ 50.
 * 
 * A and B have the same number of digits.

Small dataset

1 â¤ A â¤ B â¤ 1000.

Large dataset

1 â¤ A â¤ B â¤ 2000000.

Sample


Input 
 	
Output 
 
4
1 9
10 40
100 500
1111 2222
Case #1: 0
Case #2: 3
Case #3: 156
Case #4: 287
 */

package google.codejam.y2012.qualifications;

import google.codejam.commons.Utils;

import java.io.IOException;
import java.util.StringTokenizer;

/**
 * @author Marco Lackovic <marco.lackovic@gmail.com>
 * @version 1.0, Apr 14, 2012
 */
public class RecycledNumbers {

	private static final String INPUT_FILE_NAME = "C-large.in";
	private static final String OUTPUT_FILE_NAME = "C-large.out";

	public static void main(String[] args) throws IOException {
		String[] input = Utils.readFromFile(INPUT_FILE_NAME);
		String[] output = new String[input.length];
		int x = 0;
		for (String line : input) {
			StringTokenizer st = new StringTokenizer(line);
			int a = Integer.valueOf(st.nextToken());
			int b = Integer.valueOf(st.nextToken());
			System.out.println("Computing case #" + (x + 1));
			output[x++] = "Case #" + x + ": " + recycledNumbers(a, b);
		}
		Utils.writeToFile(output, OUTPUT_FILE_NAME);
	}

	private static int recycledNumbers(int a, int b) {
		int count = 0;
		for (int n = a; n < b; n++) {
			count += getNumGreaterRotations(n, b);
		}
		return count;
	}

	private static int getNumGreaterRotations(int n, int b) {
		int count = 0;
		char[] chars = Integer.toString(n).toCharArray();
		for (int i = 0; i < chars.length; i++) {
			chars = rotateRight(chars);
			if (chars[0] != '0') {
				int m = Integer.valueOf(new String(chars));
				if (n == m) {
					break;
				} else if (n < m && m <= b) {
					count++;
				}
			}
		}
		return count;
	}

	private static char[] rotateRight(char[] chars) {
		char last = chars[chars.length - 1];
		for (int i = chars.length - 2; i >= 0; i--) {
			chars[i + 1] = chars[i];
		}
		chars[0] = last;
		return chars;
	}

}

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.List;
import java.util.Set;
import java.util.StringTokenizer;
import java.util.concurrent.Callable;
import java.util.concurrent.ExecutionException;
import java.util.concurrent.ExecutorService;
import java.util.concurrent.Executors;
import java.util.concurrent.Future;

public class CMain {
  
  private static final ExecutorService pool = Executors.newFixedThreadPool(Runtime.getRuntime().availableProcessors());
  
  /**
   * @param args
   * @throws IOException
   * @throws ExecutionException 
   * @throws InterruptedException 
   */
  public static void main(String[] args) throws IOException, InterruptedException, ExecutionException {
    BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
    int casesCnt = Integer.parseInt(reader.readLine());
    
    List<Future<Integer>> futures = new ArrayList<Future<Integer>>();
    
    for (int i = 0; i < casesCnt; i++) {
      final String line = reader.readLine();
      Callable<Integer> task = new Callable<Integer>() {
        @Override
        public Integer call() throws Exception {
          int result = solve(line);
          return result;
        }
      };
      Future<Integer> future = pool.submit(task);
      futures.add(future);
    }
    
    int caseN = 1;
    for (Future<Integer> future : futures) {
      int result = future.get();
      System.out.printf("Case #%d: %d%n", caseN++, result);
    }
    
    pool.shutdownNow();
  }
  
  private static int solve(String line) {
    final StringTokenizer tokens = new StringTokenizer(line);
    final int A = Integer.parseInt(tokens.nextToken());
    final int B = Integer.parseInt(tokens.nextToken());
    int result = solveInner(A, B);
    return result;
  }
  
  private static int solveInner(int A, int B) {
    class Pair {
      public Pair(int x, int y) {
        if (x < y) {
          this.x = x;
          this.y = y;
        } else {
          this.x = y;
          this.y = x;
        }
      }
      final int x;
      final int y;
      @Override
      public int hashCode() {
        final int prime = 31;
        int result = 1;
        result = prime * result + x;
        result = prime * result + y;
        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 (x != other.x)
          return false;
        if (y != other.y)
          return false;
        return true;
      }
    }
    Set<Pair> results = new HashSet<Pair>();
    for (int num = A; num <= B; num++) {
      // max chunk size = floor(log(number))
      final int numLen = digits(num);
      for (int chunkLength = 1; chunkLength < numLen; chunkLength++) {
        int recycled = recycle(num, numLen, chunkLength);
        if (recycled != num && recycled >= A && recycled <= B
            && digits(recycled) == numLen) {
          results.add(new Pair(num, recycled));
        }
      }
    }
    return results.size();
  }
  
  /** max 2 millions */
  private static int digits(int num) {
    if (num < 10)
      return 1;
    if (num < 100)
      return 2;
    if (num < 1000)
      return 3;
    if (num < 10000)
      return 4;
    if (num < 100000)
      return 5;
    if (num < 1000000)
      return 6;
    return 7;
  }

  private static int recycle(int num, int numLength, int endChunkLength) {
    int base = (int) Math.pow(10, endChunkLength);
    int result = (num % base) * ((int) Math.pow(10, numLength - endChunkLength)) + num / base;
    return result;
  }

}
