#include <bits/stdc++.h>
using namespace std;
int dx[] = {0, 0, -1, 1};
int dy[] = {-1, 1, 0, 0};
void fast() {
  std::ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
}
int main() {
  int n, m;
  cin >> n >> m;
  vector<pair<int, int> > v;
  int mid = (m) / 2;
  mid -= (!(m % 2));
  int start1, start2;
  start1 = m - 1;
  start2 = 2 + (m % 2);
  for (int i = 0; i < m; i++) {
    if (i == m - 1)
      v.push_back(make_pair(i + 1, i + 1));
    else if (i < mid)
      v.push_back(make_pair(start1, i + 1)), start1 -= 2;
    else if (i > mid)
      v.push_back(make_pair(start2, i + 1)), start2 += 2;
    else
      v.push_back(make_pair(1, mid + 1));
  }
  map<int, int> mp(((v).begin()), ((v).end()));
  for (int i = 1; i <= n; i++) {
    int k = i % m;
    if (!k)
      cout << m << endl;
    else
      cout << mp[k] << endl;
  }
}
