CodeForces 222D Olympiad

D. Olympiad

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

A boy named Vasya has taken part in an Olympiad. His teacher knows that in total Vasya got at least x points for both tours of the Olympiad. The teacher has the results of the first and the second tour of the Olympiad but the problem is, the results have only points, no names. The teacher has to know Vasya's chances.

Help Vasya's teacher, find two numbers — the best and the worst place Vasya could have won. Note that the total results' table sorts the participants by the sum of points for both tours (the first place has the participant who has got the most points). If two or more participants have got the same number of points, it's up to the jury to assign places to them according to their choice. It is guaranteed that each participant of the Olympiad participated in both tours of the Olympiad.

Input

The first line contains two space-separated integers n, x (1 ≤ n ≤ 10⁵; 0 ≤ x ≤ 2·10⁵) — the number of Olympiad participants and the minimum number of points Vasya earned.

The second line contains n space-separated integers: a₁, a₂, ..., a_n (0 ≤ a_i ≤ 10⁵) — the participants' points in the first tour.

The third line contains n space-separated integers: b₁, b₂, ..., b_n (0 ≤ b_i ≤ 10⁵) — the participants' points in the second tour.

The participants' points are given in the arbitrary order. It is guaranteed that Vasya was present in the Olympiad — there are two integers i, j (1 ≤ i, j ≤ n) such, that a_i + b_j ≥ x.

Output

Print two space-separated integers — the best and the worst place Vasya could have got on the Olympiad.

Sample test(s)

Input

5 2
1 1 1 1 1
1 1 1 1 1

Output

1 5

Input

6 7
4 3 5 6 4 4
8 6 0 4 3 4

Output

1 5

Note

In the first text sample all 5 participants earn 2 points each in any case. Depending on the jury's decision, Vasya can get the first (the best) as well as the last (the worst) fifth place.

In the second test sample in the best case scenario Vasya wins again: he can win 12 points and become the absolute winner if the total results' table looks like that — {4:8, 6:4, 3:6, 4:4, 4:3, 5:0}.

In this table all participants are sorted by decreasing points and we can see how much a participant earned in the first and in the second tour.

In the worst case scenario Vasya can get the fifth place if the table looks like that — {4:8, 4:6, 6:4, 5:4, 4:3, 3:0}, and he earned 4 and 3 points in the first and second tours, correspondingly.

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <queue>
#include <ctime>
#include <cstdlib>
#include <stack>
#include <map>
#include <set>
#include <list>

#if ( _win32 || __win32__ )
    #define lld "%i64d"
#else
    #define lld "%lld"
#endif

#define MP make_pair
#define PB push_back
#define INT_INF 0x3fffffff
#define LL_INF 0x3fffffffffffffff
#define EPS 1e-12
#define MOD 1000000007
#define PI 3.14159265358979323846
#define N 100010
#define E 100010

using namespace std;

typedef long long LL;
typedef unsigned long long ULL;
typedef unsigned int Uint;
typedef double DB;

int a[N];
int b[N];

int main()
{
    int n,Min;
    while(~scanf("%d%d",&n,&Min))
    {
        for(int i=1; i<=n; i++)
            scanf("%d",a+i);
        for(int i=1; i<=n; i++)
            scanf("%d",b+i);
        sort(a+1,a+1+n);
        sort(b+1,b+1+n);
        int worst=0;
        for(int i=1; i<=n; i++)
            if(a[i]+b[i]>=Min) worst++;

        int temp=0;
        for(int i=1,j=n; i<=n && j>=1; i++)
            if(a[i]+b[j]>=Min)
            {
                temp++;
                j--;
            }
        if(worst<temp) worst=temp;

        temp=0;
        for(int i=1,j=n; i<=n && j>=1; i++)
            if(b[i]+a[j]>=Min)
            {
                temp++;
                j--;
            }
        if(temp>worst) worst=temp;
        printf("1 %d\n",worst);
    }
    return 0;
}