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

public class Natatorium {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        long area = scanner.nextInt();
        long n = scanner.nextInt();

        Set<Long> nums = new HashSet<>();
        Set<Long> potential = new HashSet<>();

        for (int i = 0; i < n; i++) {
            long num = scanner.nextInt();
            nums.add(num);

            if (area % num == 0) {
                potential.add(num);
            }
        }

        for (long p : potential) {
            long a = area / p;

            if (nums.contains(a)) {
                long bigger = Math.max(a, p);
                long lower = Math.min(a, p);

                System.out.printf("%d %d%n", lower, bigger);
                return;
            }
        }
    }

}