Codeforces Round #123 (Div. 2), problem: (B) After Training

#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
 
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define pii pair<int,int>
#define pli pair<long long int,int>
#define pbi pair<bool,int>
#define pob pop_back
#define all(a) a.begin(),a.end()
#define fio ios_base::sync_with_stdio(false); cin.tie(0);cout.tie(0);
#define i64 long long int
#define mem(x,y) memset(x,y,sizeof(x))
#define fill(arr,b) fill(arr, arr+sizeof(arr)/sizeof(arr[0]), b)
#define maxarr(n,arr,m) m =-1e9;for(int i=0;i<n;i++)if(arr[i]>m) m=arr[i];
#define read freopen("input.txt","r",stdin);
 
const double pi = acos(-1.0);
const int maxn = (i64)1e9+7;
 
int main()
{
    //read;
    int n,m;
    scanf("%d%d",&n,&m);
    int x=(m+1)/2;
    int i=0,l=0,r=m+1;
    while(i<n)
    {
        if(l<1||r>m)
        {
            printf("%d\n",x);
            l=x-1;
            r=x+1;
            i++;
            if(i==n) break;
            if(m%2==0)
            {
                printf("%d\n",r++);
                i++;
            }
            if(i==n) break;
        }
        if(l>=1)
        {
            printf("%d\n",l--);
            i++;
            if(i==n) break;
        }
        if(r<=m)
        {
            printf("%d\n",r++);
            i++;
            if(i==n) break;
        }
    }
 
    return 0;
}