ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules

Ural Championship 2005 Round II

About     Problems     Submit solution     Judge status     Standings
Contest is over

K. Magician

Time limit: 1.0 second
Memory limit: 64 MB
Denis Mednoepole is a famous magician. For example, he can read spectators' minds and tell the random number that a spectator has got by means of Denis's magic machine. Any spectator can check this: he or she just rotates the wheel of the machine and looks at the 10-digit number that has appeared in the window of the machine. Within two seconds Denis will read the spectator's mind and tell the number.
You must write a program that will tell this number even faster — within one second. You need to know that the magic machine has a wheel with N digits written along the edge of the wheel without spaces between them. All digits are of the same width. The window is 10 digits wide, so it shows 10 successive digits. Each time the wheel turns "one digit" an audible click is produced. So you know how many clicks Denis Mednoepole heard while the spectator was rotating the wheel.

Input

The first line contains two integers separated with a space, N and M. Here N (11 ≤ N ≤ 1000) is the number of the digits written on the wheel, and M (1 ≤ M ≤ 32767) is the number of clicks produced by the wheel. The next N lines contain all the digits written on the wheel, one digit per line. The digits are given in the clockwise order. The first ten digits correspond to the number visible in the window before the rotation. The wheel can be rotated only counter-clockwise, thus after one click the first digit will go out of site and the 11-th digit will become visible.

Output

Write the number that will appear in the window of the magic machine after the rotation. The number must have exactly 10 digits and may contain leading zeroes.

Sample

inputoutput
12 7
1
2
3
4
5
6
7
8
9
0
7
7
8907712345
Problem Author: Stanislav Vasilyev
Problem Source: IX Collegiate Students Urals Programming Contest. Yekaterinburg, April 19-24, 2005
To submit the solution for this problem go to the Problem set: 1370. Magician