#include <bits/stdc++.h>

#define int long long

using namespace std;

int bin(int a, int b, vector<int> &x, int f){
    int l = a;
    int u = b;
    while(l <= u){
        
        int mid = (u + l) / 2;
        if(x[mid] == f)return x[mid];
        else if(x[mid] < f)l = mid + 1;
        else u = mid -1;
    }
    return -1;
}

signed main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    int n;
    cin >> n;
    int a;
    cin >> a;
    vector<int> b(a);
    for(int i = 0; i < a; i++) cin >> b[i];

    sort(b.begin(), b.end());

    for(int i = 0; i < a; i++){
        int cur = b[i];
        if(n % cur != 0)continue;

        int find = n / cur;

        int c = bin(i+1 , a-1, b, find);
        
    
        if( c == -1){
            continue;
        }
        

        if(c < cur)continue;

        cout << cur << " " << find << "\n";
    }
}