B. Video Posts

Problem

Polycarp took $n$ videos, the duration of the $i$-th video is $a_i$ seconds. The videos are listed in the chronological order, i.e. the $1$-st video is the earliest, the $2$-nd video is the next, …, the $n$-th video is the last.

Now Polycarp wants to publish exactly $k$ ($1\le k\le n$) posts in Instabram. Each video should be a part of a single post. The posts should preserve the chronological order, it means that the first post should contain one or more of the earliest videos, the second post should contain a block (one or more videos) going next and so on. In other words, if the number of videos in the $j$-th post is $s_j$ then:

• $s_1+s_2+\cdots +s_k=n$ (KaTeX parse error: Expected 'EOF', got '&' at position 4: s_i&̲gt;0),
• the first post contains the videos: $1,2,\dots ,s_1$;
• the second post contains the videos: $s_1+1,s_1+2,\dots ,s_1+s_2$;
• the third post contains the videos: $s_1+s_2+1,s_1+s_2+2,\dots ,s_1+s_2+s_3$;
• …
• the $k$-th post contains videos: $n-s_k+1,n-s_k+2,\dots ,n$.

Polycarp is a perfectionist, he wants the total duration of videos in each post to be the same.

Help Polycarp to find such positive integer values $s_1,s_2,\dots ,s_k$ that satisfy all the conditions above.

Input

The first line contains two integers $n$ and $k$ ($1\le k\le n\le 10^5$). The next line contains $n$ positive integer numbers $a_1,a_2,\dots ,a_n$ ($1\le a_i\le 10^4$), where $a_i$ is the duration of the $i$-th video.

Output

If solution exists, print “Yes” in the first line. Print $k$ positive integers $s_1,s_2,\dots ,s_k$ ($s_1+s_2+\cdots +s_k=n$) in the second line. The total duration of videos in each post should be the same. It can be easily proven that the answer is unique (if it exists).

If there is no solution, print a single line “No”.

Examples

Input

6 3
3 3 1 4 1 6

Output

Yes
2 3 1 

Input

3 3
1 1 1

Output

Yes
1 1 1 

Input

3 3
1 1 2

Output

No

Input

3 1
1 10 100

Output

Yes
3 

Code

// #include <iostream>
// #include <algorithm>
// #include <cstring>
// #include <stack>//栈
// #include <deque>//堆/优先队列
// #include <queue>//队列
// #include <map>//映射
// #include <unordered_map>//哈希表
// #include <vector>//容器，存数组的数，表数组的长度
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
const ll N=1e5+10;
ll a[N],b[N];

void solve()
{
    ll n,k;
    cin>>n>>k;

    for(ll i=1;i<=n;i++)
    {
        cin>>a[i];
        a[i]+=a[i-1];
    }

    if(a[n]%k)
    {
        cout<<"No"<<endl;
        return;
    }

    ll res=a[n]/k;
    ll sum=res,op=0;
    for(ll i=1;i<=n;i++)
    {
        if(a[i]==sum)
        {
            b[++op]=i;
            sum+=res;
        }
    }

    if(op!=k)
    {
        cout<<"No"<<endl;
        return;
    }

    cout<<"Yes"<<endl;
    for(ll i=1;i<=k;i++) cout<<b[i]-b[i-1]<<" ";
    cout<<endl;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);

    ll t=1;
    //cin>>t;
    while(t--) solve();
    
    return 0;
}