import java.util.HashSet;
import java.util.Scanner;

public class Natatorium {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        long area = sc.nextInt();
        int count = sc.nextInt();

        HashSet<Long> lengths = new HashSet<>();

        for (int i = 0; i < count; i++) {
            lengths.add(sc.nextLong());
        }

        for (Long length : lengths) {
            if (area % length == 0) {
                long result = area / length;
                if (lengths.contains(result)) {
                    System.out.println(Math.min(length, result) + " " + Math.max(length, result));
                    break;
                }
            }
        }
    }
}
