Life is tough on the farm, and when life is tough you have to get tough. The cows have formed gangs (conveniently numbered 1 to M). The gangs coexisted in peace for a while, but now things are really getting out of control!

The cows are competing over control of a great grazing field. This conflict happens over a series of minutes. Each minute a single cow walks into the field. If the field is empty the new cow's gang is considered to take control of the field. If the field is already controlled by the new cow's gang then the cow just starts grazing. Otherwise, a single cow from the controlling gang that is grazing confronts the new cow. In these confrontations the pair of cows both leave the gang and the field. If after this confrontation the field is empty then no gang controls the field.

Bessie really wants her gang, labeled 1, to control the field after the conflict is over and all cows are either on the field or gone. Help Bessie determine if it is possible for her gang to control the field in the end. If it is possible, Bessie wants to know the maximum number of cows from her gang that could be on the field at the end, and the lexicographically earliest ordering of cows that results in this number.

Line 1: N (1 <= N <= 100) and M (1 <= M <= N) separated by a space. The total number of cows in all the gangs will be N. The total number of gangs is M.

Lines 2..1+M: The (1+i)th line indicates how many members are in gang i. Each gang has at least 1 member.

Line 1: Output YES if Bessie's gang can control the field after the conflict; otherwise output NO.

Line 2: If YES, the maximum number of cows that could be on the field.

Lines 3..2+N: If YES, on the (i+2)th line output the index of the gang of the cow that appears in the ith minute in the lexicographically earliest ordering that leaves the maximum number of cows on the field after the conflict.

riseoj 작성

출처 올림피아드 > USACO > 2012-2013 > December > Gold