#include <bits/stdc++.h>
const int N = 1e5 + 5;
int n, k, a[N];
int ans[N], top;
int main() {
  scanf("%d%d", &n, &k);
  int sum = 0;
  for (int i = 1; i <= n; i++) scanf("%d", a + i), sum += a[i];
  if (sum % k) return !printf("No");
  int num = sum / k;
  top = 0;
  int now = 0, l = 1;
  for (int i = 1; i <= n; i++) {
    now += a[i];
    if (now > num) return !printf("No");
    if (now == num) {
      ans[++top] = i - l + 1;
      l = i + 1;
      now = 0;
    }
  }
  printf("Yes\n");
  for (int i = 1; i <= top; i++) printf("%d ", ans[i]);
  return 0;
}
