#include <iostream>
#include <vector>
#include <bits/stdc++.h>


using namespace std;
using ll = long long;

int main() {
    cin.tie(0)->sync_with_stdio(0);
    ll C;
    cin >> C;
    set<ll> s;
    int n;
    cin >> n;
    while(n--){
        ll p;
        cin >> p;
        if(s.count(C/p)){
            ll needed = C/p;
            if(needed*p == C){
                cout << min(p, C/p) << " " << max(p, C/p) << endl;
                return 0;
            }
        }
        s.insert(p);
    }
}