#include <iostream>
#include <algorithm>

using namespace std;

int main() {
    long long C, M;
    cin >> C >> M;

    int m[M];

    for (int i = 0; i < M; i++) {
        cin >> m[i];
    }

    sort(m, m + M);

    int start = 0;
    int end = M-1;

    while ( m[start] * m[end] != C ) {
        if ( m[start] * m[end] > C )
            end--;
        else
            start++;
    }

    cout << m[start] << " " << m[end];

    return 0;
}