import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.HashSet;
import java.util.Set;


public class GoogleC {
	public String szamol(String input){
		String result="";
		String a=input;
		Integer min=Integer.parseInt(a.substring(0,a.indexOf(' ')));
		a=a.substring(a.indexOf(' ')+1);
		Integer max=Integer.parseInt(a);
		Long count=0l;
		for(Integer i=min; i<=max; i++){
			String e1=i.toString();
			Set<Integer> db=new HashSet<Integer>(); 
			for (int j=1; j<e1.length();j++){
				
				String e2=e1.substring(j)+e1.substring(0,j);
				Integer k=Integer.parseInt(e2);
				if (k>i && k<=max){
					db.add(k);
					//System.out.println(e1+"\t"+e2);
				}
				
			}
			count+=db.size();
		}
		
		return count.toString();
	}
	public static void main(String[] args) {
		GoogleC a=new GoogleC();
		//String filename="input.txt";
		//String filename="C-small-attempt0.in";
		String filename="C-large.in";
		String thisLine;
		try {
			BufferedReader br = new BufferedReader(new FileReader(filename));
			BufferedWriter bw= new BufferedWriter(new FileWriter(filename+".out"));
			thisLine=br.readLine();
			Integer tnum=Integer.parseInt(thisLine);
		     for(int i=0;i<tnum;i++) { // while loop begins here
		    	 	thisLine=br.readLine();
		           System.out.println(thisLine);
		           System.out.println("Case #"+(i+1)+": "+a.szamol(thisLine)+"\n");
		           bw.write("Case #"+(i+1)+": "+a.szamol(thisLine)+"\n");
		         } // end while 
		        // end try
		     br.close();
		     bw.close();
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}


	}

}

package nl.maartenvangrootel.googlecodejam.qualifier.recycling;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.util.regex.Pattern;

/**
 * Hello world!
 * 
 */
public class Recycling {
	private File file;

	private static Pattern pattern = Pattern.compile("[\\ ]");

	public Recycling(String filename) {
		if (filename == null)
			throw new IllegalArgumentException("filename should not be null");

		file = new File(filename);
		if (!(file.exists() && file.isFile()))
			throw new IllegalArgumentException(String.format(
					"'%s' does not exist or is not a file.", filename));

	}

	private BufferedReader getReader() {
		BufferedReader reader = null;
		try {
			FileReader stream = new FileReader(file);
			reader = new BufferedReader(stream);
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		}

		return reader;
	}

	public String calculateResult() {
		BufferedReader reader = getReader();

		StringBuilder builder = new StringBuilder();
		try {
			int numberOfCases = Integer.parseInt(reader.readLine());
			int i = 1;
			String line;
			while ((line = reader.readLine()) != null) {
				if (i > 1) {
					builder.append("\n");
				}
				builder.append("Case #");
				builder.append(i);
				builder.append(": ");
				builder.append(parseLine2(line));
				i++;
			}
		} catch (IOException e) {
			e.printStackTrace();
		}

		return builder.toString();
	}

	public static long parseLine2(String line) {
		String[] input = pattern.split(line);
		int length = input[0].length();
		boolean even = length % 2 == 0;

		long mod = (long) Math.pow(10, (length / 2));

		long A = Integer.parseInt(input[0]);
		long B = Integer.parseInt(input[1]);
		long cnt = 0;
		long compensation = 0;
		for (long n = A; n <= B; n++) {
			String strN = String.valueOf(n);
			for (int i = length - 1; i > 0; i--) {
				for (int j = length; j > i; j--) {
					String deel1 = strN.substring(i, j);
					String deel2 = strN.substring(0, i);
					String strM = deel1 + deel2;
					if ("".equals(strM))
						continue;

					long m = Long.parseLong(strM);

					if (m >= A && m <= B && n < m) {
						if (even && n % mod == n / mod) {
							compensation++;
						}
						cnt++;
					}
				}
			}
		}

		return cnt - compensation / 2;
	}

	public static void main(String[] args) {
		Recycling starter = new Recycling("src/main/resources/small.txt");
		String result = starter.calculateResult();

		System.out.println(result);
	}
}
