codeforces231C

To Add or Not to Add

CodeForces – 231C

A piece of paper contains an array of n integers a₁, a₂, …, a_n. 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 kfollowing 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 ktimes (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 ≤ 10⁵; 0 ≤ k ≤ 10⁹) — 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 a₁, a₂, …, a_n (|a_i| ≤ 10⁹) — 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 array 5, 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.

sol：因为只能加，所以这个很显然是用较小的数得到较大的数，而且肯定是满足单调性的，排序后二分即可

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
inline ll read()
{
    ll s=;
    bool f=;
    char ch=' ';
    while(!isdigit(ch))
    {
        f|=(ch=='-'); ch=getchar();
    }
    while(isdigit(ch))
    {
        s=(s<<)+(s<<)+(ch^); ch=getchar();
    }
    return (f)?(-s):(s);
}
#define R(x) x=read()
inline void write(ll x)
{
    if(x<)
    {
        putchar('-'); x=-x;
    }
    if(x<)
    {
        putchar(x+''); return;
    }
    write(x/);
    putchar((x%)+'');
    return;
}
#define W(x) write(x),putchar(' ')
#define Wl(x) write(x),putchar('\n')
const int N=;
int n,m;
ll a[N],Qzh[N];
inline int TwoFind(int l,int r)
{
    int Pos=r,ans=Pos+;
    while(l<=r)
    {
        int mid=(l+r)>>;
        if(a[Pos]*(Pos-mid+)-(Qzh[Pos]-Qzh[mid-])<=m)
        {
            ans=mid;
            r=mid-;
        }
        else l=mid+;
    }
    return ans;
}
int main()
{
    int i,ansx=,ansy=;
    ll Sum=;
    R(n); R(m);
    for(i=;i<=n;i++) R(a[i]);
    sort(a+,a+n+);
    Qzh[]=; for(i=;i<=n;i++) Qzh[i]=Qzh[i-]+a[i];
    for(i=;i<=n;i++)
    {
        int oo=TwoFind(,i);
        if(i-oo+>ansx)
        {
            ansx=i-oo+; ansy=a[i];
        }
    }
    W(ansx); Wl(ansy);
    return ;
}
/*
Input
5 3
6 3 4 0 2
Output
3 4Input
3 4
5 5 5
Output
3 5Input
5 3
3 1 2 2 1
Output
4 2
*/