CodeForces - 195B —After Training

B. After Training

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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 ≤ 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

往篮子里放球 ，遵循一个规律  第一个球放在最中间 然后一前一后一前一后  这样放m个球   然后在重复这个步骤   注意判断一下篮子个数的奇偶。

#include<stdio.h>
#define maxn 100010
int main()
{
    int a[maxn],b[maxn];
    int n,m,i,k;
    while(scanf("%d%d",&n,&m)!=EOF)
    {
        for(i=1;i<=m;i++)
            b[i]=0;
        if(m%2!=0)
        {
            a[1]=(m+1)/2;
            for(i=2,k=1;i<=m;i++)
            {
                if(i%2==0)
                    a[i]=(m+1)/2-k;
                else
                {
                    a[i]=(m+1)/2+k;
                    k++;
                }
            }
        }
        else
        {
            a[1]=(m+1)/2;
            a[2]=(m+1)/2+1;
            for(i=3,k=1;i<=m;i++)
            {
                if(i%2!=0)
                    a[i]=(m+1)/2-k;
                else
                {
                    a[i]=(m+1)/2+1+k;
                    k++;
                }
            }

        }
        for(i=m+1,k=1;i<=n;i++)
        {
            a[i]=a[k];
            if(k==m)
                k=1;
            else
                k++;
        }
        for(i=1;i<=n;i++)
            printf("%d\n",a[i]);
    }
}