Video Posts

题意简述: 给你一个$n$个数的数列，要求将它分割成$k$段，第一段的和为$Sum_1$，长度为$s_1$，第二段为$Sum_2$，长度为$s_2$，以此类推，要求$$Sum_1 = Sum_2 = Sum_3 =..... Sum_k$ 如果无解输出"No"，有解时输出格式如下: 第一行输出"Yes" 第二行输出$s_1$, $s_2$, $s_3$, $s_4$....$s_k$，每个数之间用空格分开

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+\dots+s_k=n $ ( $ s_i>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.

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.

If solution exists, print "Yes" in the first line. Print $ k $ positive integers $ s_1, s_2, \dots, s_k $ ( $ s_1+s_2+\dots+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".

6 3
3 3 1 4 1 6

Yes
2 3 1 

3 3
1 1 1

Yes
1 1 1 

3 3
1 1 2

No

3 1
1 10 100

Yes
3