#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC oprimize("unrol-loops")

#define vec vector
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define int long long

using namespace std;

typedef pair<int, int> pii;

const int inf = 2e18;
int mod = 100000007;


void solve(){
    int c;
    cin>>c;
    int n;
    cin>>n;
    map<int, int> used;
    vec<int> a(n);
    for(int i = 0;i<n;i++)
    {
        cin >> a[i];
        used[a[i]]++;
    }
    sort(all(a));
    for(int i = 0;i<n;i++){
        if(c % a[i] == 0){
            int d = c / a[i];
            if(used[d]){
                cout << a[i]<< " " << d << "\n";
                return;
            }
        }
    }

}

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int tests = 1;
    while(tests--){
        solve();
    }
}