#include <bits/stdc++.h>
using namespace std;
int a[10005], n;
/**
          j
7 2 7 3 7 2
  i
*/
int df(int n)
{
    int e, f = 2,maxPrim = 0;
    while(n != 1)
    {
        e = 0;
        while(n % f == 0) n /= f, e++;

        if(e != 0) maxPrim = max(maxPrim, f);

        if(f * f <= n) f++;
        else f = n;
    }

    return maxPrim;
}
int main()
{
    int i, task;
    cin >> n >> task;
    for(i = 1; i <= n; i++)
    {
        cin >> a[i];
        a[i] = df(a[i]);
    }
    for(i = 1; i <= n; i++)
    {

    }
    return 0;
}