252662256 252662260
 141650963 141650963
 4 12
 1002523 1002523
 93 95
 331900277 331900277
 56 92
 10 100
 3 1000000000
 13 13
 2 879190747
 999900001 1000000000
 820844234 892579936
 419873015 419873018
 568814539 568814539
 999999937 999999937
 519002744 519002744
 80270976 80270977
 5 10
 3 6
 392602363 392602367
 6 12
 634097178 634097179
 6 15
 3 10
 305693653 305693653
 2 3
 1200007 1200007
 5 100
 10000019 10000019
 720270740 720270743
 94 95
 908580370 968054552
 760632746 850720703
 900000011 900000011
 37622224 162971117
 5 5
 76 134
 3 12
 39 91
 999992977 999992977
 17 17
 29 29
 770439256 770439256
 347877978 913527175
 3 8
 5 15
 349533413 349533413
 100000007 100000007
 104729 104729
 900000000 1000000000
 479001599 479001599
 999727999 999727999
 1717 1717
 15 27
 100003 100003
 51 52
 17 35
 1000003 1000003
 6 8
 11 11
 741254764 741254768
 2 2
 30 37
 2 1000000000
 4 8
 620769961 988145114
 951594860 953554446
 450868287 450868290
 575062045 575062049
 28829775 28829776
 999999797 999999797
 990000023 990000023
 871232720 871232722
 242 244
 273072892 273072894
 2 999999999
 7 7
 38 98
 39916801 39916801
 998244353 998244353
 3 111111
 3 3
 982451653 982451653
 3 18
 47 52
 999999103 999999103
 999999929 999999929
 3 99
 715827883 715827883
 12 18
 999999733 999999733

2
 141650963
 2
 1002523
 2
 331900277
 2
 2
 2
 13
 2
 2
 2
 2
 568814539
 999999937
 519002744
 2
 2
 2
 2
 2
 2
 2
 2
 305693653
 2
 1200007
 2
 10000019
 2
 2
 2
 2
 900000011
 2
 5
 2
 2
 2
 999992977
 17
 29
 770439256
 2
 2
 2
 349533413
 100000007
 104729
 2
 479001599
 999727999
 1717
 2
 100003
 2
 2
 1000003
 2
 11
 2
 2
 2
 2
 2
 2
 2
 2
 2
 2
 999999797
 990000023
 2
 2
 2
 2
 7
 2
 39916801
 998244353
 2
 3
 982451653
 2
 2
 999999103
 999999929
 2
 715827883
 2
 999999733

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class Test {
	public static void main(String[] args) throws IOException  {
		divisor();
	}
	static class Scanner {
        StringTokenizer st;
        BufferedReader br;

        public Scanner(InputStream system) {br = new BufferedReader(new InputStreamReader(system));}
        public Scanner(String file) throws Exception {br = new BufferedReader(new FileReader(file));}
        public String next() throws IOException
        {
            while (st == null || !st.hasMoreTokens()) st = new StringTokenizer(br.readLine());
            return st.nextToken();
        }
        public String nextLine()throws IOException{return br.readLine();}
        public int nextInt() throws IOException {return Integer.parseInt(next());}
        public double nextDouble() throws IOException {return Double.parseDouble(next());}
        public char nextChar()throws IOException{return next().charAt(0);}
        public Long nextLong()throws IOException{return Long.parseLong(next());}
        public boolean ready() throws IOException{return br.ready();}
        public void waitForInput() throws InterruptedException {Thread.sleep(3000);}
    }
	public static void team() throws IOException {
		Scanner sc=new Scanner(System.in);
		String problemS=sc.nextLine();
		int problem=Integer.parseInt(problemS);
		int i=0;
		String[][] set = new String[problem][];
		do {
			String s=sc.nextLine();
			String[] tmp=s.split(" ");
			set[i]=tmp;
			i++;
		}while(i<problem);
		int result=0;
		for (int j = 0; j < problem ; j++) {
			int count =0;
			for (int k = 0; k <3 ; k++) {
				count+=Integer.parseInt(set[j][k]);
			}
			if(count>=2)
				result++;
		}
		System.out.println(result);
	}
	public static void divisor() throws IOException {
		Scanner sc=new Scanner(System.in);
		String in=sc.nextLine();
		String[] value=in.split(" ");
		int n1=Integer.parseInt(value[0]);
		int n2=Integer.parseInt(value[1]);
		int[] count =new int [n2+1];
		for (int i = n1; i <=n2; i++) {
			if(prime(i)) {
				continue;
			}else {
				String div=divisor(i);
				for (int j = 0; j < div.length(); j++) {
					int tmp=Character.getNumericValue(div.charAt(j));
					count[tmp]++;
				}
			}
		}
		int max=2;
		for (int i = 3; i < count.length; i++) {
			if(count[i]>count[max])
				max=i;
		}
		System.out.println(max);
	}
	public static boolean prime(int n) {
		if(n==3 || n==2 )
			return false;
		for (int i = 2; i < n; i++) {
			if((n%i)==0)
				return false;
		}
		return true;
	}
	public static String divisor(int n) {
		String result="";
		for (int i = 2; i <= n; i++) {
			if((n%i)==0)
				result=result+i;
		}
		System.out.println(result);
		return result;
	}
}



