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.io.File;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.Scanner;


public class RecycledNumbers {

	public static void main(String[] args) {
		Scanner input;
		try {
			File in = new File(args[0]);
			input = new Scanner(in);
			int testcaseSize = Integer.parseInt(input.nextLine());
			int testcaseNo = 1;
			
			String output = "";
			while ((input.hasNext()) && testcaseNo <= testcaseSize) {
				//read input
				String s = input.nextLine();			
				//solve problem
				String result = solve(s);
				//record formatted result 
				String outputLine = String.format("Case #%d: %s\n", testcaseNo, result);
				//append output
				output += outputLine;
				
				testcaseNo++;
			}
			input.close();
			//print output
			System.out.print(output);
			// write output file
			FileWriter writer = new FileWriter(in.getName() +".out");
			writer.write(output);
			writer.close();
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		} catch (IOException e) {
			e.printStackTrace();
		}
	}
	
	public static String solve (String text){
		String result = "";
		int A = Integer.parseInt(text.substring(0,text.indexOf(" ")));
		int B = Integer.parseInt(text.substring(text.indexOf(" ")+1, text.length()));
		HashSet<Integer> set = new HashSet<Integer>();
		int digits = text.indexOf(" ");

		ArrayList<Integer> list1 = new ArrayList<Integer>();
		ArrayList<Integer> list2 = new ArrayList<Integer>();
		for (int n=A; n<=B; n++){
			if (!set.contains(n)) {
				String nString = Integer.toString(n);
				HashSet<Integer> group = new HashSet<Integer>();
				group.add(n);
				
				for (int j=1; j<digits; j++){
					String part1 = nString.substring(0,j);
					String part2 = nString.substring(j,digits);
					int m = Integer.parseInt(part2+part1);
					if (m>=A && m<=B && m!=n) {
						group.add(m);
					}
				}
				
				for (int i : group) set.add(i);
				Object[] groupArray = group.toArray();
				for (int i=0; i<group.size()-1; i++){
					for (int j=i+1; j<group.size(); j++){
						list1.add((Integer)groupArray[i]);
						list2.add((Integer)groupArray[j]);
					}
				}
			}
		}
		
//		for (int i=0;i<list1.size();i++){
//			System.out.println(String.format("(%d,%d);", list1.get(i), list2.get(i)));
//		}
//		System.out.println();
		result = String.valueOf(list1.size());
		return result;
	}
}
