2018-2019 ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) |
---|

Finished |

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

K. Video Posts

time limit per test

3 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputPolycarp 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.

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

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

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Oct/22/2019 07:45:57 (h1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|