CF1070K.Video Posts

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 \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.

波利卡普拍摄了 $n$ 段视频，其中第 $i$ 段视频的时长为 $a_i$ 秒。这些视频按时间顺序排列，即第 $1$ 段视频最早，第 $2$ 段视频次之，……，第 $n$ 段视频最晚。

现在波利卡普希望在 Instabram 上恰好发布 $k$（$1 \le k \le n$）个帖子。每段视频必须且仅属于一个帖子。帖子需保持原始的时间顺序，即第一个帖子应包含一段（或若干段）最早的视频，第二个帖子应包含紧随其后的一段（或若干段）视频，依此类推。换言之，若第 $j$ 个帖子包含 $s_j$ 段视频，则需满足：

• $s_1+s_2+\dots+s_k=n$（其中每个 $s_i > 0$）；
• 第一个帖子包含视频编号：$1, 2, \dots, s_1$；
• 第二个帖子包含视频编号：$s_1+1, s_1+2, \dots, s_1+s_2$；
• 第三个帖子包含视频编号：$s_1+s_2+1, s_1+s_2+2, \dots, s_1+s_2+s_3$；
• ……
• 第 $k$ 个帖子包含视频编号：$n-s_k+1, n-s_k+2, \dots, n$。

波利卡普是个完美主义者，他希望每个帖子中所有视频的总时长完全相等。

请帮助波利卡普找出满足上述所有条件的正整数 $s_1, s_2, \dots, s_k$。

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.

第一行包含两个整数 $n$ 和 $k$（$1 \le k \le n \le 10^5$）。下一行包含 $n$ 个正整数 $a_1, a_2, \dots, a_n$（$1 \le a_i \le 10^4$），其中 $a_i$ 表示第 $i$ 个视频的时长。

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".

如果存在解，在第一行输出“Yes”。在第二行输出 $k$ 个正整数 $s_1, s_2, \dots, s_k$（满足 $s_1+s_2+\dots+s_k=n$）。每条帖子中视频的总时长应相等。可以轻松证明：若解存在，则该解唯一。

若无解，仅输出一行“No”。