#include <cstdio>
#include <set>
#include <algorithm>
int main(int argc, char const *argv[])
{
    unsigned long long C;
    std::set<unsigned long long> stored;
    scanf("%lld\n",&C );
    long long M;
    scanf("%lld\n", &M);
    // printf("loaded %lld %lld\n", C,M);
    unsigned long long first;
    unsigned long long second;


    unsigned long long prime;
    for(int i=0;i<M;i++){
        scanf("%lld", &prime);
        if(stored.find(prime)!= stored.end()){
            // printf("found %lld %lld\n", prime, C/prime);
            first = std::min(prime, C/prime);
            second = std::max(prime, C/prime);
            printf("%lld %lld\n", first,second);
            break;
        }
        getchar(); //newline or space
        if(C%prime == 0){
            // printf("insert %lld\n", C/prime);
            //bylo celociselne
            stored.insert(C/prime);
        }
    }   
    return 0;
}