Quiz League

题意翻译

#### 题意简述 给定 $n$ 个 $0$ 或 $1$ 的数围成一个环，第一个数的位置是 $1$。现在给定一个 $k$，从第 $k$ 个数开始顺时针遍历整个环，求第一个 $1$ 的位置。 #### 输入格式 第一行 $2$ 个数，$n$ 和 $k$。 第二行 $n$ 个数，以顺时针顺序依次读入整个环上的数。 #### 输出格式 一个数，代表从第 $k$ 个数开始顺时针遍历整个环时第一个 $1$ 的位置。 #### 数据范围与约定 $1 \leqslant k \leqslant n \leqslant 1000$。 保证环上的每一个数都是 $0$ 或 $1$。

题目描述

A team quiz game called "What? Where? When?" is very popular in Berland. The game is centered on two teams competing. They are the team of six Experts versus the team of the Audience. A person from the audience asks a question and the experts are allowed a minute on brainstorming and finding the right answer to the question. All it takes to answer a typical question is general knowledge and common logic. The question sent be the audience are in envelops lain out in a circle on a round table. Each envelop is marked by the name of the asker's town. Each question is positioned in a separate sector. In the centre of the table is a spinning arrow. Thus, the table rather resembles a roulette table with no ball but with a spinning arrow instead. The host sets off the spinning arrow to choose a question for the experts: when the arrow stops spinning, the question it is pointing at is chosen. If the arrow points at the question that has already been asked, the host chooses the next unanswered question in the clockwise direction. Your task is to determine which will be the number of the next asked question if the arrow points at sector number $ k $ .

输入输出格式

输入格式

The first line contains two positive integers $ n $ and $ k $ ( $ 1<=n<=1000 $ and $ 1<=k<=n $ ) — the numbers of sectors on the table and the number of the sector where the arrow is pointing. The second line contains $ n $ numbers: $ a_{i}=0 $ if the question from sector $ i $ has already been asked and $ a_{i}=1 $ if the question from sector $ i $ hasn't been asked yet ( $ 1<=i<=n $ ). The sectors are given in the clockwise order, the first sector follows after the $ n $ -th one.

输出格式

Print the single number — the number of the sector containing the question the experts will be asked. It is guaranteed that the answer exists, that is that not all the questions have already been asked.

输入输出样例

输入样例 #1

5 5
0 1 0 1 0

输出样例 #1

2

输入样例 #2

2 1
1 1

输出样例 #2

1