#include <iostream>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#define pb push_back
#define fr(n) for (int i = 0; i<n;i++)
#define print(n) cout<<n
#define input(n) cin>>n
typedef long long ll;
using namespace std;
ll pot (ll q, ll w){
ll qw = 1;
for (ll i = 0; i<w; i++)
qw*= q;
return qw;
}
int main () {
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n;//broj kompanija kojima Nadan daje novac
int k;//koliko kuna ima
cin >> k;
cin >> n;
int t = 0;
for (int i=0; i<n-1; i++){
t++;
cout<< t << endl;
}
if (k-t != k/2){
cout << k-t;
}
return 0;
}
