939B. Hamster Farm

Dima 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¹⁸, 1 ≤ K ≤ 10⁵) — 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₁, a₂, ..., a_K (1 ≤ a_i ≤ 10¹⁸ 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

Copy

19 3
5 4 10

Output

2 4

Input

Copy

28 3
5 6 30

Output

1 5

题意：

有n个hamsters，k种箱子，每种箱子可以装不同数量的hamsters，求买哪种箱子几个可以尽可能的

装完n个hamsters，可以剩下但是箱子必须装满

思路：直接暴力寻找余数最小的箱子

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5+10;
ll arr[N];
int main(){
    ll n,k;
    scanf("%lld%lld",&n,&k);
    for(ll i=1;i<=k;i++)
       scanf("%lld",&arr[i]);
    ll index=0,mint=1e18;
    for(ll i=1;i<=k;i++){
    	if(n%arr[i]<mint){
    		mint=n%arr[i];
    		index=i;
		}
	}
	if(index) printf("%lld %lld\n",index,n/arr[index]);
	else printf("%lld %lld\n",1,n/arr[1]);
	return 0;
}