import java.util.ArrayList;
import java.util.HashSet;
import java.util.Scanner;
import java.util.TreeSet;

public class Task1 {

    public static void main(String[] args) {
        Scanner vstup = new Scanner(System.in);
        long obsah = vstup.nextLong();
        int pocetPrvkov = (int) vstup.nextLong();

        long[] mozneDlzky = new long[pocetPrvkov];
        for (int i = 0; i < pocetPrvkov; i++) {
            mozneDlzky[i] = vstup.nextLong();
        }

        HashSet<Long> moznosti = new HashSet<>();
        for (long l : mozneDlzky) {
            moznosti.add(l);
        }

        for (int i = 0; i < mozneDlzky.length - 1; i++) {
            if (obsah % mozneDlzky[i] != 0) {
                continue;
            }
            if (moznosti.contains(obsah / mozneDlzky[i])) {
                System.out.println(Math.min(mozneDlzky[i], obsah / mozneDlzky[i]) + " " + Math.max(mozneDlzky[i], obsah / mozneDlzky[i]));
                break;
            }
        }
    }
}