#include int main() { int Ct, M; int P; int L[M + 1]; int cnt = 0; scanf("%d", &Ct); scanf("%d", &M); for (int i = 0; i < M; i++) { scanf("%d", &P); L[i] = P; } int C2=Ct; int resMas[cnt]; for (int i = 0; i < M; i++) { if (C2 % L[i] == 0) { resMas[cnt]=L[i]; cnt++; } } if (resMas[0] > resMas[1]) { int bin = resMas[0]; resMas[0] = resMas[1]; resMas[1] = bin; } else { int bin = resMas[1]; resMas[1] = resMas[0]; resMas[0] = bin; } printf("%d %d", resMas[0], resMas[1]); return 0; }