Bug#389

Bug

1 seconde
256 mégaoctets
Hard

While Sakurako was watching a video on the Internet about her favorite game, she found a bug which was as follows:

You have some number of money, displayed as a number in some rectangle. The rectangle has length pixels, and Sakurako knows the length of each digit (for example, may take pixel, so it will take pixel in the rectangle), and between any two digits in the number, there is one pixel (for example, if takes pixel then takes , since per each digit and between them). If the length of the number is bigger than , then she gets infinite money.

Sakurako knows that she can get at most money, so she asks you if it is possible that she can perform the bug. More formally, if there is a number such that x\le m and the length of is bigger than .

Input

The first line contains integers a_0,a_1, \dots,a_9 (1\le a_i\le 20) — a_i is the length of the digit .

The second line contains two integers and (1\le n\le 360, 1\le m\le 10^{18}) — length of the rectangle and maximum amount of money Sakurako can get.

Output

Output "Yes" if Sakurako can perform the bug, and "No" otherwise. If your answer is "Yes", you should output a valid answer in the next line.

If there are multiple correct answers, you are allowed to print any of them.

Examples

Example 1

Loading
Loading

Example 2

Loading
Loading

Note

In the first example, the total length of number in pixels is equal to 1+1+1+1+1+1+1+1+1+1+1=11 pixels.

In the second example, the total length of number in pixels is equal to 10+1+10+1+10+1+10+1+10=54 pixels.

Scoring

In this problem, there are conditional blocks. If your solution works correctly for certain constraints, it will receive a certain number of points. Note that testing is going test by test, but not by blocks.

  1. ( points): a_i=1 for all 0\le i\le 9;

  2. ( points): m\le 10^5;

  3. ( points): without additional constraints.