After Training CodeForces - 195B

After Training

CodeForces - 195B

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 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 ≤ 10⁵) — 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

注意：这个题|m+1/2-i|算距离应该使用double！！！！！

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <queue>
using namespace std;
const int maxn = 1e5+10;
struct node{
    int id;
    double dis;
    int num;
    bool operator < (const node& other)const{
        if(num == other.num && dis == other.dis)
            return id > other.id;
        else if(num == other.num)
            return dis > other.dis;
        return num > other.num;
    }
};
int n,m;
priority_queue<node> q;
void init(){
    double midd = ((double)m + 1.0) / 2.0;
    for(int i = 1; i <= m; i++){
        node a;
        a.id = i;
        a.dis = fabs(midd-(double)i);
        a.num = 0;
        q.push(a);
    }
}
int main(){
    scanf("%d%d",&n,&m);
    init();
    for(int i = 1; i <= n; i++){
        node tmp = q.top();
        q.pop();
        printf("%d\n",tmp.id);
        tmp.num++;
        q.push(tmp);
    }
    return 0;
}