#include <iostream>
#include <set>

using namespace std;

int main() {
    long int area, len;
    cin >> area >> len;
    set<long int> primes;

    for (; len > 0; --len) {
        long int p;
        cin >> p;
        primes.insert(p);
    }

    for (auto & p : primes) {
        auto first = area / p;
        auto second = primes.find(first);
        
        if (p * (*second) != area)
            continue;

        if (second != primes.end()) {
            if (p < (*second)) {
                cout << p << " " << (*second) << endl;
            } else
                cout << (*second) << " " << p << endl;
            return 0;
        }
    }

    return 0;
}