#include <bits/stdc++.h>
const int maxn = 1e5 + 3;
int n;
int k;
int A;
int a[maxn];
int ans[maxn];
int main() {
  int sum = 0;
  scanf("%d%d", &n, &k);
  for (int i = 1; i <= n; ++i) scanf("%d", &a[i]), sum += a[i];
  if (sum % k) {
    puts("No");
    return 0;
  }
  sum /= k;
  for (int i = 1; i <= n;) {
    int now = 0, nowsum = 0;
    while (nowsum < sum && i <= n) nowsum += a[i++], ++now;
    if (nowsum > sum) {
      puts("No");
      return 0;
    }
    ans[++A] = now;
  }
  puts("Yes");
  for (int i = 1; i < A; ++i) printf("%d ", ans[i]);
  printf("%d\n", ans[A]);
  return 0;
}
