#include <bits/stdc++.h>
using namespace std;
long long int digSum(long long int n) {
  long long int sum = 0;
  while (n != 0) {
    sum += n % 10;
    n = n / 10;
  }
  return sum;
}
bool cmp1(int a, int b) { return a < b; }
bool cmp2(int a, int b) { return a > b; }
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int n, k, sum2 = 0, sum1 = 0, x;
  cin >> n >> k;
  vector<int> v(n), ans;
  for (int(i) = 0; (i) < (n); (i)++) {
    cin >> v[i];
    sum1 += v[i];
  }
  x = sum1 / k;
  bool ok = true;
  if (sum1 % k == 0) {
    int i = 0;
    while (i < n) {
      long long int sum2 = 0;
      long long int ct = 0;
      while (i < n && sum2 < x) {
        sum2 += v[i];
        i++;
        ct++;
      }
      if (sum2 == x) {
        ans.push_back(ct);
      } else {
        ok = false;
        break;
      }
    }
    if (ok) {
      cout << "Yes";
      cout << endl;
      for (int i = 0; i < ans.size(); i++) {
        cout << ans[i] << " ";
      }
    } else {
      cout << "No";
      cout << endl;
    }
  } else {
    cout << "No";
    cout << endl;
  }
  return 0;
}
