Problem: After a team finished their training session on Euro football championship, Valeric was commissioned to gather the balls and sort them into baskets. Overall the stadium has n balls and m baskets. The baskets are positioned in a row from left to right and they are numbered with numbers from 1 to m, correspondingly. The balls are numbered with numbers from 1 to n.

Valeric decided to sort the balls in the order of increasing of their numbers by the following scheme. He will put each new ball in the basket with the least number of balls. And if he's got several variants, he chooses the basket which stands closer to the middle. That means that he chooses the basket for which <image> is minimum, where i is the number of the basket. If in this case Valeric still has multiple variants, he chooses the basket with the minimum number.

For every ball print the number of the basket where it will go according to Valeric's scheme.

Note that the balls are sorted into baskets in the order of increasing numbers, that is, the first ball goes first, then goes the second ball and so on.

Input

The first line contains two space-separated integers n, m (1 ≤ n, m ≤ 105) — the number of balls and baskets, correspondingly.

Output

Print n numbers, one per line. The i-th line must contain the number of the basket for the i-th ball.

Examples

Input

4 3


Output

2
1
3
2


Input

3 1


Output

1
1
1

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using li = __int128;
using uli = unsigned __int128;
using ld = long double;
using pii = pair<int, int>;
using vi = vector<int>;
void doReplace() {}
template <typename T, typename U, typename... Vs>
void doReplace(T &t, const U &u, Vs &&...vs) {
  t = u;
  doReplace(vs...);
}
template <typename T, typename... Us>
T minim(T &was, const T &cand, Us &&...us) {
  if (was > cand) {
    was = cand;
    doReplace(us...);
  }
  return was;
}
template <typename T, typename... Us>
T maxim(T &was, const T &cand, Us &&...us) {
  if (was < cand) {
    was = cand;
    doReplace(us...);
  }
  return was;
}
template <typename D>
D dPower(D base, ll exponent) {
  if (exponent < 0) {
    return dPower(1 / base, -exponent);
  }
  if (exponent == 0) {
    return 1;
  }
  if ((exponent & 1) == 1) {
    return dPower(base, exponent - 1) * base;
  } else {
    D res = dPower(base, exponent >> 1);
    return res * res;
  }
}
class NumberIterator : iterator<forward_iterator_tag, int> {
 public:
  int v;
  NumberIterator(int v) : v(v) {}
  operator int &() { return v; }
  int operator*() { return v; }
};
class range : pii {
 public:
  range(int begin, int end) : pii(begin, max(begin, end)) {}
  range(int n) : pii(0, max(0, n)) {}
  NumberIterator begin() { return first; }
  NumberIterator end() { return second; }
};
template <typename T>
class arr {
  T *b;
  int n;
  void allocate(int sz) {
    n = sz;
    if (sz > 0) {
      b = (T *)(::operator new(sz * sizeof(T)));
    } else {
      b = nullptr;
    }
  }

 public:
  arr(int n = 0) { allocate(n); }
  arr(int n, const T &init) {
    allocate(n);
    for (int i : range(n)) {
      ::new ((void *)(b + i)) T(init);
    }
  }
  arr(int n, arr<T> arr1) {
    allocate(n);
    for (int i : range(n)) {
      b[i] = arr1.b[i];
    }
  }
  arr(initializer_list<T> l) : arr(l.size()) {
    if (n > 0) {
      memcpy(b, l.begin(), n * sizeof(T));
    }
  }
  arr(T *b, int n) : arr(b, b + n) {}
  arr(T *b, T *e) : b(b), n(e - b) {}
  int size() const { return n; }
  T *begin() { return b; }
  T *operator+(int x) { return b + x; }
  const T *operator+(int x) const { return b + x; }
  const T *begin() const { return b; }
  T *end() { return b + n; }
  const T *end() const { return b + n; }
  arr<T> clone() const {
    arr<T> res(n);
    copy(b, b + n, res.begin());
    return res;
  }
  T &operator[](int at) { return b[at]; }
  const T &operator[](int at) const { return b[at]; }
  bool operator==(const arr &other) const {
    if (n != other.n) {
      return false;
    }
    for (int i : range(n)) {
      if (b[i] != other.b[i]) {
        return false;
      }
    }
    return true;
  }
  vector<T> view() { return vector<T>(b, b + min(n, 50)); }
};
void decreaseByOne() {}
template <typename T, class... Vs>
void decreaseByOne(arr<T> &array, Vs &...vs) {
  int n = array.size();
  for (int i : range(n)) {
    array[i]--;
  }
  decreaseByOne(vs...);
}
template <typename T, typename U>
void decreaseByOne(arr<pair<T, U>> &v) {
  for (auto &p : v) {
    p.first--;
    p.second--;
  }
}
template <typename T>
class arr2d {
  T *b;
  int d1;
  int d2;
  int sz;
  void allocate(int n) {
    if (n > 0) {
      b = (T *)(::operator new(n * sizeof(T)));
    } else {
      b = nullptr;
    }
  }

 public:
  arr2d(int d1 = 0, int d2 = 0) : d1(d1), d2(d2), sz(d1 * d2) { allocate(sz); }
  arr2d(int d1, int d2, const T &init) : d1(d1), d2(d2), sz(d1 * d2) {
    allocate(sz);
    for (int i : range(sz)) {
      ::new ((void *)(b + i)) T(init);
    }
  }
  arr2d(T *b, int d1, int d2) : b(b), d1(d1), d2(d2), sz(d1 * d2) {}
  int size() const { return sz; }
  int dim1() const { return d1; }
  int dim2() const { return d2; }
  T *begin() { return b; }
  T *end() { return b + sz; }
  T &operator()(int i1, int i2) { return b[i1 * d2 + i2]; }
  const T &operator()(int i1, int i2) const { return b[i1 * d2 + i2]; }
  T &operator[](const pii &p) { return operator()(p.first, p.second); }
  const T &operator[](const pii &p) const {
    return operator()(p.first, p.second);
  }
  arr<T> operator[](int at) { return arr<T>(b + at * d2, d2); }
  vector<vector<T>> view() {
    vector<vector<T>> res(min(d1, 50));
    for (int i : range(res.size())) {
      res[i] = (*this)[i].view();
    }
    return res;
  }
  arr2d<T> clone() {
    arr2d<T> res(d1, d2);
    copy(b, b + sz, res.b);
    return res;
  }
};
inline bool isWhitespace(int c) { return isspace(c) || c == EOF; }
class Input {
 private:
  bool exhausted = false;
  int bufSize = 4096;
  char *buf = new char[bufSize];
  int bufRead = 0;
  int bufAt = 0;

 public:
  inline int get() {
    if (exhausted) {
      return EOF;
    }
    if (bufRead == bufAt) {
      bufRead = fread(buf, sizeof(char), bufSize, stdin);
      bufAt = 0;
    }
    if (bufRead == bufAt) {
      exhausted = true;
      return EOF;
    }
    return buf[bufAt++];
  }
  inline int peek() {
    if (exhausted) {
      return EOF;
    }
    if (bufRead == bufAt) {
      bufRead = fread(buf, sizeof(char), bufSize, stdin);
      bufAt = 0;
    }
    if (bufRead == bufAt) {
      exhausted = true;
      return EOF;
    }
    return buf[bufAt];
  }

 private:
  template <typename T>
  inline T readInteger() {
    int c = skipWhitespace();
    int sgn = 1;
    if (c == '-') {
      sgn = -1;
      c = get();
    }
    T res = 0;
    do {
      if (!isdigit(c)) {
        return sgn * res;
      }
      res *= 10;
      res += c - '0';
      c = get();
    } while (!isWhitespace(c));
    return res * sgn;
  }
  void initArrays(int) {}
  template <typename T, class... Vs>
  void initArrays(int n, arr<T> &array, Vs &...vs) {
    array = arr<T>(n, T());
    initArrays(n, vs...);
  }
  template <typename T, class... Vs>
  void initArrays(int n, vector<T> &, Vs &...vs) {
    initArrays(n, vs...);
  }
  void readImpl(int) {}
  template <typename T, class... Vs>
  void readImpl(int i, arr<T> &arr, Vs &...vs) {
    arr[i] = readType<T>();
    readImpl(i, vs...);
  }
  template <typename T, class... Vs>
  void readImpl(int i, vector<T> &arr, Vs &...vs) {
    arr.push_back(readType<T>());
    readImpl(i, vs...);
  }

 public:
  inline int skipWhitespace() {
    int c;
    while (isWhitespace(c = get()) && c != EOF)
      ;
    return c;
  }
  inline int peekNext() {
    while (isWhitespace(peek()) && peek() != EOF) {
      get();
    }
    return peek();
  }
  inline int readInt() { return readInteger<int>(); }
  inline ll readLong() { return readInteger<ll>(); }
  inline unsigned readUnsigned() { return readInteger<unsigned>(); }
  string readString() {
    int c = skipWhitespace();
    if (c == EOF) {
      return "";
    }
    string res;
    do {
      res.push_back(c);
    } while (!isWhitespace(c = get()));
    return res;
  }
  arr<int> readIntArray(int size) { return readArray<int>(size); }
  arr<ll> readLongArray(int size) { return readArray<ll>(size); }
  arr<double> readDoubleArray(int size) { return readArray<double>(size); }
  arr<string> readStringArray(int size) { return readArray<string>(size); }
  arr<char> readCharArray(int size) { return readArray<char>(size); }
  template <typename T>
  T readType() {
    throw "Operation not supported";
  }
  template <typename U, typename V>
  pair<U, V> readType() {
    U first = readType<U>();
    V second = readType<V>();
    return make_pair(first, second);
  }
  template <typename T>
  arr<T> readArray(int n) {
    arr<T> res(n, T());
    for (int i : range(n)) {
      res[i] = readType<T>();
    }
    return res;
  }
  template <class... Vs>
  void readArrays(int n, Vs &...vs) {
    initArrays(n, vs...);
    for (int i : range(n)) {
      readImpl(i, vs...);
    }
  }
  template <typename U, typename V>
  arr<pair<U, V>> readArray(int n) {
    arr<pair<U, V>> res(n);
    for (int i : range(n)) {
      res[i] = readType<U, V>();
    }
    return res;
  }
  template <typename T>
  arr2d<T> readTable(int rows, int cols) {
    arr2d<T> result(rows, cols);
    for (int i : range(rows)) {
      for (int j : range(cols)) {
        result(i, j) = readType<T>();
      }
    }
    return result;
  }
  arr2d<int> readIntTable(int rows, int cols) {
    return readTable<int>(rows, cols);
  }
  arr2d<char> readCharTable(int rows, int cols) {
    return readTable<char>(rows, cols);
  }
  string readLine() {
    int c = get();
    if (c == EOF) {
      return "";
    }
    string res;
    do {
      res.push_back(c);
      c = get();
    } while (c != '\n' && c != '\r' && c != EOF);
    return res;
  }
  inline double readDouble() {
    int c = skipWhitespace();
    int sgn = 1;
    if (c == '-') {
      sgn = -1;
      c = get();
    }
    double res = 0;
    do {
      if (tolower(c) == 'e') {
        return sgn * res * dPower(double(10), readInt());
      }
      if (!isdigit(c)) {
        return sgn * res;
      }
      res *= 10;
      res += c - '0';
      c = get();
    } while (!isWhitespace(c) && c != '.');
    if (c == '.') {
      double add = 0;
      int length = 0;
      c = get();
      do {
        if (tolower(c) == 'e') {
          return sgn * (res + add * dPower(double(10), -length)) *
                 dPower(double(10), readInt());
        }
        if (!isdigit(c)) {
          res += add * dPower(10, -length);
          return res * sgn;
        }
        add *= 10;
        add += c - '0';
        length++;
        c = get();
      } while (!isWhitespace(c));
      res += add * dPower(double(10), -length);
    }
    return res * sgn;
  }
  inline char readChar() {
    int c = skipWhitespace();
    if (c == EOF) {
      return 0;
    }
    return c;
  }
  inline bool isExhausted() { return exhausted; }
  inline void setBufSize(int newBufSize) {
    if (newBufSize > bufSize) {
      char *newBuf = new char[newBufSize];
      memcpy(newBuf, buf, bufSize);
      buf = newBuf;
    }
    bufSize = newBufSize;
  }
};
template <>
inline double Input::readType() {
  return readDouble();
}
template <>
inline int Input::readType() {
  return readInt();
}
template <>
inline ll Input::readType() {
  return readLong();
}
template <>
inline unsigned Input::readType() {
  return readUnsigned();
}
template <>
inline char Input::readType() {
  return readChar();
}
template <>
inline string Input::readType() {
  return readString();
}
Input in;
class Output {
 private:
  ostream *out;
  template <typename T>
  inline void printSingle(const T &value) {
    *out << value;
  }
  template <typename T>
  void printSingle(const vector<T> &array) {
    size_t n = array.size();
    for (int i : range(n)) {
      *out << array[i];
      if (i + 1 != n) {
        *out << ' ';
      }
    }
  }
  template <typename T>
  void printSingle(const arr<T> &array) {
    int n = array.size();
    for (int i : range(n)) {
      *out << array[i];
      if (i + 1 != n) {
        *out << ' ';
      }
    }
  }
  template <typename T>
  void printSingle(const arr2d<T> &array) {
    size_t n = array.dim1();
    size_t m = array.dim2();
    for (int i : range(n)) {
      for (int j : range(m)) {
        *out << array(i, j);
        if (j + 1 != m) {
          *out << ' ';
        }
      }
      if (i + 1 != n) {
        *out << '\n';
      }
    }
  }
  template <typename T, typename U>
  inline void printSingle(const pair<T, U> &value) {
    *out << value.first << ' ' << value.second;
  }

 public:
  bool autoflush;
  Output(ostream &out, bool autoflush) : out(&out), autoflush(autoflush) {
    setPrecision(20);
  }
  void setOut(ostream &nOut) {
    out = &nOut;
    setPrecision(20);
  }
  inline void print() {}
  template <typename T, typename... Targs>
  inline void print(const T &first, const Targs... args) {
    printSingle(first);
    if (sizeof...(args) != 0) {
      *out << ' ';
      print(args...);
    }
    if (autoflush) {
      flush();
    }
  }
  template <typename... Targs>
  inline void printLine(const Targs... args) {
    print(args...);
    *out << '\n';
    if (autoflush) {
      flush();
    }
  }
  inline void flush() { out->flush(); }
  inline void setPrecision(int digs) { *out << fixed << setprecision(digs); }
};
Output out(cout, false);
Output err(cerr, true);
class BAfterTraining {
 public:
  void solve() {
    int n = in.readInt(), m = in.readInt();
    vi pattern;
    if (m % 2) {
      pattern.push_back(m / 2 + 1);
      for (int i : range(1, m / 2 + 1)) {
        pattern.push_back(m / 2 + 1 - i);
        pattern.push_back(m / 2 + 1 + i);
      }
    } else {
      for (int i : range(0, m / 2)) {
        pattern.push_back(m / 2 - i);
        pattern.push_back(m / 2 + 1 + i);
      }
    }
    int whole = n / m;
    for (int i : range(whole)) {
      for (int v : pattern) {
        out.printLine(v);
      }
    }
    int rem = n % m;
    for (int i : range(rem)) {
      out.printLine(pattern[i]);
    }
  }
};
int main() {
  std::ios_base::sync_with_stdio(false);
  std::cin.tie(nullptr);
  BAfterTraining solver;
  solver.solve();
  fflush(stdout);
  return 0;
}