#include <bits/stdc++.h>
using namespace std;
template <typename T, typename T2>
T2 fac(T n) {
  return n < 2 ? 1 : fac<T, T2>(n - 1) * n;
}
template <typename T, typename T2, typename T3>
T2 fac(T n, T3 mod) {
  return n < 2 ? 1 : (fac<T, T2, T3>(n - 1, mod) * n) % mod;
}
template <typename T>
T nb_combinaisons(T k, T n) {
  if (n < k) return nb_combinaisons<T>(n, k);
  return fac<T, long long int>(n) /
         (fac<T, long long int>(n - k) * fac<T, long long int>(k));
}
template <typename T, typename T2>
T nb_permutations(vector<T2> v) {
  T total = fac<T, T>(v.size());
  map<T2, T> m;
  bool distinct = true;
  for (long long unsigned c = 0; c < v.size(); c++) {
    m[v[c]]++;
    if (m[v[c]] - 1) distinct = false;
  }
  for (typename map<T2, T>::iterator it = m.begin(); it != m.end(); it++)
    total /= fac<T, T>(it->second);
  return total;
}
template <typename T, typename T2, typename T3>
T nb_permutations(vector<T2> v, T3 mod) {
  T total = fac<T, T, T3>(v.size(), mod);
  map<T2, T> m;
  bool distinct = true;
  for (long long unsigned c = 0; c < v.size(); c++) {
    m[v[c]]++;
    if (m[v[c]] - 1) distinct = false;
  }
  for (typename map<T2, T>::iterator it = m.begin(); it != m.end(); it++)
    total /= fac<T, T>(it->second);
  return total % mod;
}
string itoa_2(long long int n) {
  string s;
  stringstream ss;
  ss << n;
  ss >> s;
  while (s.size() != 9) s = '0' + s;
  return s;
}
int pgcd(int a, int b) {
  if (a == 0) return b;
  if (b == 0) return a;
  return pgcd(b, a % b);
}
string conversion(int n, int base) {
  string res = "";
  while (n != 0) {
    res = ((char)('0' + n % base)) + res;
    n /= base;
  }
  return res;
}
int main() {
  int n, m;
  cin >> n >> m;
  int i = 0;
  vector<int> v;
  if (m % 2 == 0) {
    int gauche = (m - 1) / 2 + 1;
    int droite = (m - 1) / 2 + 2;
    bool g = true;
    for (int c = 0; c < n; c++) {
      if (g) {
        cout << gauche << endl;
        if (gauche - 1 <= 0) {
          gauche = (m - 1) / 2 + 1;
        } else
          gauche--;
      } else {
        cout << droite << endl;
        if (droite + 1 > m)
          droite = (m - 1) / 2 + 2;
        else
          droite++;
      }
      g = !g;
    }
  } else {
    int gauche = (m) / 2;
    int droite = (m) / 2 + 2;
    bool g = true;
    for (int c = 0; c < n; c++) {
      if (c % m == 0)
        cout << (m / 2) + 1 << endl;
      else if (g) {
        cout << gauche << endl;
        if (gauche - 1 <= 0) {
          gauche = (m) / 2;
        } else
          gauche--;
      } else {
        cout << droite << endl;
        if (droite + 1 > m)
          droite = (m) / 2 + 2;
        else
          droite++;
      }
      if (c % m != 0) g = !g;
    }
  }
}
