#include <algorithm>
#include <cstdio>
using namespace std;
const int M = 1e5 + 5;
int n, x, a[M], b[M];
int main() {
#ifndef ONLINE_JUDGE
freopen("test.in", "r", stdin);
freopen("test.out", "w", stdout);
#endif
scanf("%d%d", &n, &x);
for (int i = 0; i < n; i++) {
scanf("%d", a + i);
}
for (int i = 0; i < n; i++) {
scanf("%d", b + i);
}
printf("1 ");
sort(a, a + n);
sort(b, b + n);
reverse(a, a + n); //a从大到小排序
int j = 0, ans = 0;
for (int i = 0; i < n; i++) {
while (j < n && b[j] + a[i] < x) {
j++;
}
if (j >= n) break;
ans++;
j++;
}
printf("%d", ans);
return 0;
}