CodeForces 231C To Add or Not to Add

C. To Add or Not to Add

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

A piece of paper contains an array of n integers a1, a2, ..., an. Your task is to find a number that occurs the maximum number of times in this array.

However, before looking for such number, you are allowed to perform not more than k following operations — choose an arbitrary element from the array and add 1 to it. In other words, you are allowed to increase some array element by 1 no more than k times (you are allowed to increase the same element of the array multiple times).

Your task is to find the maximum number of occurrences of some number in the array after performing no more than k allowed operations. If there are several such numbers, your task is to find the minimum one.

Input

The first line contains two integers n and k (1 ≤ n ≤ 105; 0 ≤ k ≤ 109) — the number of elements in the array and the number of operations you are allowed to perform, correspondingly.

The third line contains a sequence of n integers a1, a2, ..., an (|ai| ≤ 109) — the initial array. The numbers in the lines are separated by single spaces.

Output

In a single line print two numbers — the maximum number of occurrences of some number in the array after at most k allowed operations are performed, and the minimum number that reaches the given maximum. Separate the printed numbers by whitespaces.

Examples

input

5 3
6 3 4 0 2

output

3 4

input

3 4
5 5 5

output

3 5

input

5 3
3 1 2 2 1

output

4 2

Note

In the first sample your task is to increase the second element of the array once and increase the fifth element of the array twice. Thus, we get sequence 6, 4, 4, 0, 4, where number 4 occurs 3 times.

In the second sample you don't need to perform a single operation or increase each element by one. If we do nothing, we get array5, 5, 5, if we increase each by one, we get 6, 6, 6. In both cases the maximum number of occurrences equals 3. So we should do nothing, as number 5 is less than number 6.

In the third sample we should increase the second array element once and the fifth element once. Thus, we get sequence 3, 2, 2, 2, 2, where number 2 occurs 4 times.

/*  CodeForces 231C

给n个数  可以任意数加值，每次加1，一共可以加m次 不需要全部用完

问怎么加 使得操作完后 其中一个数出现的次数最多
如有多个 输出最小的

Input
5 3
6 3 4 0 2   (加一次给3 两次给2)
Output
3 4     (最多有3个4)

有点像 two pointer 法
先排序
cur 记录当前位置
sum 记录在cur之后 i之前的数 都加到a[i]这个数所需要的值
然后 m < 当前值的话
    cur 往后移
 再 i 往后移

还有就是 sum会爆int 啊  要用long long
*/
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <queue>
#include <vector>
#include <cmath>
#include <stack>
#include <map>
#include <set>
#define pi acos(-1)
#define LL long long
#define INF 0x3f3f3f3f
using namespace std;
const int maxn = 1e5 + 5;

LL a[maxn];
int main(void)
{
//	freopen("C:\\Users\\wave\\Desktop\\NULL.exe\\NULL\\in.txt","r", stdin);
    LL n, m, i, j, k, d;
    LL mcnt, mnum, t, sum, cur, tmp;
    cin >> n >> m;
    for (i = 1; i <= n; i++)
        cin >> a[i];
    sort(a+1, a+1+n);
    mcnt = 1;
    mnum = a[1];
    sum = 0;
    cur = 1;
    t = 0;
    for (i = 2; i <= n; i++){
        d = a[i] - a[i-1];
        t++;
        sum += d * t;
        while (sum > m){
            sum -= a[i] - a[cur];
            cur++;
            t--;
        }
        if (t + 1 > mcnt){
            mcnt = t + 1;
            mnum = a[i];
        }
    }
    printf("%I64d %I64d\n", mcnt, mnum);

    return 0;
}