#include <bits/stdc++.h>
using namespace std;
long long power(long long x, long long y) {
  long long res = 1;
  while (y > 0) {
    if (y % 2 == 1) res *= x;
    y /= 2;
    x *= x;
  }
  return res;
}
int prime(int no) {
  int flag = 0;
  for (int i = 2; i <= (sqrt(no) + 1); i++)
    if (no % i == 0) flag = 1;
  if (flag == 0)
    return 1;
  else
    return 0;
}
int main() {
  int n, m;
  cin >> n >> m;
  int temp = n / m;
  int rem = n % m;
  int no = temp;
  for (int i = 1; i <= m; i++) {
    if (i <= (m - rem))
      cout << no << " ";
    else
      cout << no + 1 << " ";
  }
  cout << endl;
  ;
}
