#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1e6+5;
const int M = 1e18;
int a[N];
vector<int> x;
vector<int> y;
int p[N];
int r[N];
unordered_map<int,int> cnt;
void SieveU(){
  for ( int i = 1; i <= N; i++ ){
    for ( int j = i; j <= N; j+=i ){
      p[j]++;
    }
  }
}
int bs ( int l , int r , int x ){
  int i = l;
  int res = M;
  while ( l <= r ){
    int mid = ( l+r)/2;
    if ( p[mid] - p[i-1] >= x ){
      if ( p[mid]-p[i-1] == x ){
        res = min(res,mid);
      }
      r = mid - 1;
    }
    else{
      l = mid + 1;
    }
  }
  return res;
}
void solve(){
  SieveU();
  int n;
  cin >> n;
  int k;
  cin >> k;
  for ( int i = 1 ;  i <= n; i++ ){
    int x;
    cin >> x;
    a[i] = p[x];
    cout << a[i] << " ";
    p[i]++;
  }
  p[0] = 0;
  for ( int i = 1; i <= n; i++ ){
    p[i] = p[i-1] + p[i];
  }
  int ans = M;
  for ( int i = 1; i <= n; i++  ){
    int k = bs(i,n,k);
    if ( k != M ) ans = min(ans,k-i+1);
  }
  cout << ans;

}
signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t;
    t = 1;
    while ( t-- ){
      solve();
    }
}