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

B. Hamster Farm

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputDima has a hamsters farm. Soon *N* hamsters will grow up on it and Dima will sell them in a city nearby.

Hamsters should be transported in boxes. If some box is not completely full, the hamsters in it are bored, that's why each box should be completely full with hamsters.

Dima can buy boxes at a factory. The factory produces boxes of *K* kinds, boxes of the *i*-th kind can contain in themselves *a*_{i} hamsters. Dima can buy any amount of boxes, but he should buy boxes of only one kind to get a wholesale discount.

Of course, Dima would buy boxes in such a way that each box can be completely filled with hamsters and transported to the city. If there is no place for some hamsters, Dima will leave them on the farm.

Find out how many boxes and of which type should Dima buy to transport maximum number of hamsters.

Input

The first line contains two integers *N* and *K* (0 ≤ *N* ≤ 10^{18}, 1 ≤ *K* ≤ 10^{5}) — the number of hamsters that will grow up on Dima's farm and the number of types of boxes that the factory produces.

The second line contains *K* integers *a*_{1}, *a*_{2}, ..., *a*_{K} (1 ≤ *a*_{i} ≤ 10^{18} for all *i*) — the capacities of boxes.

Output

Output two integers: the type of boxes that Dima should buy and the number of boxes of that type Dima should buy. Types of boxes are numbered from 1 to *K* in the order they are given in input.

If there are many correct answers, output any of them.

Examples

Input

19 3

5 4 10

Output

2 4

Input

28 3

5 6 30

Output

1 5

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Oct/18/2019 18:20:53 (f2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|