package it.simone.google.code.jam2012;

import java.util.HashSet;
import java.util.Set;

public class RecycledNumber implements GoogleCodeExercise {

	int a = 0;
	int b = 0;
	Set<Couple> distinctCouple = null;
	long maxTime = 0;

	private class Couple {
		int x = 0;
		int y = 0;

		public Couple(int x, int y) {
			this.x = x;
			this.y = y;
		}

		@Override
		public int hashCode() {
			final int prime = 31;
			int result = 1;
			result = prime * result + getOuterType().hashCode();
			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;
			Couple other = (Couple) obj;
			if (!getOuterType().equals(other.getOuterType()))
				return false;
			if (x == other.x && y == other.y)
				return true;
			if (x == other.y && y == other.x)
				return true;
			return false;
		}

		private RecycledNumber getOuterType() {
			return RecycledNumber.this;
		}

	}

	@Override
	public String execute(String line) {
		int result = 0;

		String[] data = line.split(" ");
		a = Integer.parseInt(data[0]);
		b = Integer.parseInt(data[1]);
		initialize();

		int n = a;
		//
		while (n <= b) {
			result += analize(n);
			n++;
//			if (n % 1000 == 0)
//				System.out.println(n);
		}

		System.out.println(result);
		return "" + result;
	}

	@Override
	public void initialize() {
		distinctCouple = new HashSet<Couple>();
	}

	private int analize(int number) {
		String numString = "" + number;
		initialize();
		for (int i = 1; i < numString.length(); i++) {
			int m = shift(numString, i);
			if (a <= number && number < m && m <= b) {
				Couple couple=new Couple(number,m);
				if (!distinctCouple.contains(couple))
					distinctCouple.add(couple);
			}
		}
		return distinctCouple.size();
	}

	private int shift(String numString, int posx) {

		String result = null;
		result = "" + numString.substring(posx) + numString.substring(0, posx);

		return Integer.parseInt(result.toString());
	}

}

import java.util.*;
import java.io.*;

public class Qual2012 {

	public static void lame() {
		try {
			FileReader fr = new FileReader("input.txt");
			BufferedReader reader = new BufferedReader(fr);
			PrintWriter writer = new PrintWriter("output.txt");

			HashMap<String, String> dictionary = new HashMap<String, String>();
			dictionary.put("a", "y");
			dictionary.put("b", "h");
			dictionary.put("c", "e");
			dictionary.put("d", "s");
			dictionary.put("e", "o");
			dictionary.put("f", "c");
			dictionary.put("g", "v");
			dictionary.put("h", "x");
			dictionary.put("i", "d");
			dictionary.put("j", "u");
			dictionary.put("k", "i");
			dictionary.put("l", "g");
			dictionary.put("m", "l");
			dictionary.put("n", "b");
			dictionary.put("o", "k");
			dictionary.put("p", "r");
			dictionary.put("q", "z");
			dictionary.put("r", "t");
			dictionary.put("s", "n");
			dictionary.put("t", "w");
			dictionary.put("u", "j");
			dictionary.put("v", "p");
			dictionary.put("w", "f");
			dictionary.put("x", "m");
			dictionary.put("y", "a");
			dictionary.put("z", "q");
			dictionary.put(" ", " ");
			int numCases = Integer.parseInt(reader.readLine());

			for (int i = 1; i <= numCases; i++) {
				String sentence = reader.readLine();
				String newSentence = "";
				for (char c : sentence.toCharArray()) {
					char[] temp = new char[1];
					temp[0] = c;
					newSentence += dictionary.get(new String(temp));
				}
				writer.println("Case #" + i + ": " + newSentence);
			}

			writer.close();
			fr.close();
		} catch (Exception e) {
			e.printStackTrace();
		}
	}

	public static boolean canMatch(int score, int target) {
		if (score == 0)
			return target <= 0;
		if (score == 1 || score == 2)
			return target <= 1;
		if (score % 3 == 0) {
			return score / 3 >= target;
		}
		return ((score / 3) + 1 >= target);
	}

	public static boolean canMatchSpecial(int score, int target) {
		if (score == 0)
			return target <= 0;
		if (score == 1)
			return target <= 1;
		if (score == 2)
			return target <= 2;
		if (score % 3 == 1)
			return (score / 3 + 1) >= target;
		return (score / 3 + 2) >= target;
	}

	public static void dance() {
		try {
			FileReader fr = new FileReader("input.txt");
			BufferedReader reader = new BufferedReader(fr);
			PrintWriter writer = new PrintWriter("output.txt");

			int numCases = Integer.parseInt(reader.readLine());
			for (int i = 1; i <= numCases; i++) {
				StringTokenizer line = new StringTokenizer(reader.readLine(),
						" ");
				int numDancers = Integer.parseInt(line.nextToken());
				int numSurprising = Integer.parseInt(line.nextToken());
				int bestScore = Integer.parseInt(line.nextToken());
				List<Integer> scores = new LinkedList<Integer>();
				for (int j = 0; j < numDancers; j++)
					scores.add(Integer.parseInt(line.nextToken()));
				int count = 0;
				for (Integer score : scores) {
					if (canMatch(score, bestScore))
						count++;
					else if (canMatchSpecial(score, bestScore)
							&& numSurprising > 0) {
						numSurprising--;
						count++;
					}
				}
				writer.println("Case #" + i + ": " + count);
			}

			writer.close();
			fr.close();

		} catch (Exception e) {
			e.printStackTrace();
		}
	}

	public static void recycle() {
		try {
			FileReader fr = new FileReader("input.txt");
			BufferedReader reader = new BufferedReader(fr);
			PrintWriter writer = new PrintWriter("output.txt");
			
			int numCases = Integer.parseInt(reader.readLine());
			for (int i = 1; i <= numCases; i++) {
				StringTokenizer line = new StringTokenizer (reader.readLine(), " ");
				int A = Integer.parseInt(line.nextToken());
				int B = Integer.parseInt(line.nextToken());
				int count = 0;
				for (int k = A; k <= B; k++) {
					if (k < 10) {
						continue;
					}
					String temp = "" + k;
					String cmp = "" + k;
					int length = temp.length();
					temp = temp.substring(length-1) + temp.substring(0, length - 1);
					while (!temp.equals(cmp)) {
						int cycle = Integer.parseInt(temp);
						if (A <= cycle && cycle <= B)
							count++;
						temp = temp.substring(length-1) + temp.substring(0, length - 1);
					}
				}
				writer.println ("Case #" + i + ": " + count/2);
			
				
			}
			
			writer.close();
			fr.close();
		} catch (Exception e) {
			e.printStackTrace();
		}
	}

	public static void main(String[] args) {
		// lame();
		// dance();
		recycle();
		
	}
}