ffff

#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int i, k, n, W[100000], l, r, c;
vector <int> in, ik;
int main()
{
    cin >> n >> k;
    for (i = 0; i < n; i++){
        cin >> W[i];
    }
    for (j = 0; j < n; j++){
      for (i = 0; i < k; i++){
        ik.push_back(W[i]);
        sort (ik.begin(), ik.end());
        l = ik[i];
        r = ik[k-1];
        c = (l + r)/2;
        in.push_back(c);
      }
    }
    cout <<  << endl;
    return 0;
}