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

The problem statement has recently been changed. View the changes.

×
D. Valera and Fools

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputOne fine morning, *n* fools lined up in a row. After that, they numbered each other with numbers from 1 to *n*, inclusive. Each fool got a unique number. The fools decided not to change their numbers before the end of the fun.

Every fool has exactly *k* bullets and a pistol. In addition, the fool number *i* has probability of *p*_{i} (in percent) that he kills the fool he shoots at.

The fools decided to have several rounds of the fun. Each round of the fun looks like this: each currently living fool shoots at another living fool with the smallest number (a fool is not stupid enough to shoot at himself). All shots of the round are perfomed at one time (simultaneously). If there is exactly one living fool, he does not shoot.

Let's define a situation as the set of numbers of all the living fools at the some time. We say that a situation is possible if for some integer number *j* (0 ≤ *j* ≤ *k*) there is a nonzero probability that after *j* rounds of the fun this situation will occur.

Valera knows numbers *p*_{1}, *p*_{2}, ..., *p*_{n} and *k*. Help Valera determine the number of distinct possible situations.

Input

The first line contains two integers *n*, *k* (1 ≤ *n*, *k* ≤ 3000) — the initial number of fools and the number of bullets for each fool.

The second line contains *n* integers *p*_{1}, *p*_{2}, ..., *p*_{n} (0 ≤ *p*_{i} ≤ 100) — the given probabilities (in percent).

Output

Print a single number — the answer to the problem.

Examples

Input

3 3

50 50 50

Output

7

Input

1 1

100

Output

1

Input

2 1

100 100

Output

2

Input

3 3

0 0 0

Output

1

Note

In the first sample, any situation is possible, except for situation {1, 2}.

In the second sample there is exactly one fool, so he does not make shots.

In the third sample the possible situations are {1, 2} (after zero rounds) and the "empty" situation {} (after one round).

In the fourth sample, the only possible situation is {1, 2, 3}.

Codeforces (c) Copyright 2010-2023 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Feb/08/2023 03:49:43 (h1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|