#include <bits/stdc++.h>
using namespace std;
#define ll long long

const int N= 3e5+5;
int R[N];
void solve() {
   int k,n;
   scanf("%d%d",&k,&n);
   if(k==1) {
      int x = (n+1)/2;
      for(int i=0;i<x;++i) {
         printf("%d ", 1);
      }
      return;
   } else if(k%2==0) {
      printf("%d ", k/2);
      for(int i=0;i<n-1;++i) {
         printf("%d ", k);
      }
      return;
   } else {
      for(int i=0;i<n;++i) {
         R[i] = (k+1)/2;
      }
      int pos = n-1;
      int diff = n/2;

      while(diff--) {
         --R[pos];
         if(R[pos]==0) {
            --pos;
         } else {
            for(int j = pos+1;j<n;++j) {
               R[j] = k;
            }
            pos = n-1;
         }
      }
      for(int i=0;i<=pos;++i) {
         printf("%d ", R[i]);
      }
      putchar('\n');
   }
}
int main() {
   //freopen("input.txt","r",stdin);
   solve();
}