#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <cmath>

using namespace std;

const int maxn = 1005;

int n, k, v[maxn], lst[maxn * maxn], ptr;

void divide(int x)
{
    int lim = sqrt(x);
    for(int i = 1; i <= lim; ++i)
        if(!(x % i))
            lst[++ptr] = i, lst[++ptr] = x / i;
    if(lim * lim == x) ptr--;
}
bool cmp(int a, int b)
{
    return a > b;
}

int main()
{
    scanf("%d%d", &n, &k);
    for(int i = 1; i <= n; ++i) scanf("%d", &v[i]);
    for(int i = 1; i <= n; ++i)
        divide(v[i]);
    sort(lst + 1, lst + 1 + ptr, cmp);
    int tmp = 1;
    for(int i = 1; i <= ptr; ++i)
    {
        if(lst[i] == lst[i - 1]) tmp++;
        else tmp = 1;
        if(tmp >= k)
        {
            printf("%d\n", lst[i]);
            return 0;
        }
    }
    return 0;
}

#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <vector>
#include <bitset>
#include <vector>

using namespace std;

typedef long long ll;

const int maxn = 1e+5 + 5;

int s, ans, lim;

bitset<maxn> ispr; int prime[maxn >> 1], cnt;
inline void euler()
{
    ispr.set(); ispr.reset(1);
    for(int i = 2; i < maxn; ++i)
    {
        if(ispr.test(i)) prime[++cnt] = i;
        for(int j = 1; j <= cnt && i * prime[j] < maxn; ++j)
        {
            ispr.reset(i * prime[j]);
            if(!(i % prime[j])) break;
        }
    }
}
inline int isprime(int x)
{
    if(x < maxn) return ispr.test(x);
    for(int i = 1; i <= cnt && prime[i] * prime[i] <= x; ++i)
        if(!(x % prime[i])) return 0;
    return 1;
}

vector<int> vec;
inline void dfs(ll del, int id, ll prod)
{
    if(del == 1) 
    {
        vec.push_back(prod);
        return;
    }
    if(del - 1 >= prime[id] && isprime(del - 1))
        vec.push_back(prod * (del - 1));
    ll prd, sum; 
    for(int i = id; prime[i] * prime[i] <= del; ++i)
    {
        prd = prime[i];
        sum = prime[i] + 1;
        for(; sum <= del; prd *= prime[i], sum += prd)
            if(!(del % sum)) dfs(del / sum, i + 1, prod * prd);
    }
    return;
}

int main()
{
    euler();
    while(scanf("%d", &s) != EOF)
    {
        vec.clear(); 
        dfs((ll)s, 1, 1ll);
        printf("%lu\n", vec.size());
        sort(vec.begin(), vec.end());
        for(vector<int>::iterator i = vec.begin(); i != vec.end(); ++i)
            printf("%d ", (*i));
        if(vec.size()) putchar('\n');
    }
    return 0;
}

#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <bitset>

using namespace std;

const int maxn = 1005;

int n, m;
bitset<maxn> mtr[maxn];

int main()
{
    scanf("%d%d", &n, &m);
    int x, y;
    for(int i = 1; i <= m; ++i)
    {
        scanf("%d%d", &x, &y);
        mtr[x][y] = 1;
    }
    for(int k = 1; k <= n; ++k)
        for(int i = 1; i <= n; ++i)
            if(mtr[i][k])
                mtr[i] |= mtr[k];
    int tot = 0;
    for(int i = 1; i <= n; ++i)
        for(int j = i + 1; j <= n; ++j)
            if(!mtr[i][j] && !mtr[j][i]) tot++;
    printf("%d\n", tot);
    return 0;
}