#include <stdio.h>
#include <stdlib.h>
#include <math.h>

int main(int argc, char const *argv[])
{
    long area;
    scanf("%ld", &area);

    int n;
    scanf("%d", &n);

    long* arr = (long*)malloc(sizeof(long) * n);

    for (int i = 0; i < n; i++){
        scanf("%ld", &arr[i]);
    }

    for (int i = 0; i < n; i++){
        if (area % arr[i] == 0){
            long prime = area/arr[i];
            for(int j = 0; j < n; j++){
                if (arr[j] == prime){
                    if (prime > arr[i]){
                        printf("%ld %ld", arr[i], prime);
                    }else {
                        printf("%ld %ld", prime, arr[i]);
                    }
                    return 0;
                }
            }
        }
    }



    return 0;
}