#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long int;

int main(){

    ll c, m, n;
    vector<ll> p;

    cin >> c >> m;

    for(ll i = 0 ; i < m ; ++i){
        cin >>n;
        p.push_back(n);
    }
    sort(p.begin(), p.end(), [](ll a, ll b) {
        return a > b; });

    ll front = 0;
    ll back = p.size() - 1;

    while (true) {
        ll one = p[front];
        ll second = p[back];
        ll res = one * second;
        if(res == c) {
            cout << second << " " << one << endl;
            return 0;
        }
        if(res < c) {
            --back;
            continue;
        }
        if (res > c) {
            ++front;
            continue;
        }
    }


    return 0;
}