#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main(){
    ll c,m;
    cin>>c>>m;
    unordered_set<ll> p;
    for(int i=0;i<m;i++){
		ll x;
		cin>>x;
		p.insert(x);
	}
    for(auto x : p){
		if (c%x == 0 && p.find(c/x) != p.end()) {
			ll y = c/x;
			if (y<x) {
				swap(y,x);
			}
			cout<<x<<" "<<y<<"\n";
			return 0;
		}
	}
}