#include <bits/stdc++.h>
#pragma optimization_level 3
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
using namespace std;
const long long N = 1e5 + 5;
const long long mod = 1e9 + 7;
const long long INF = 1e18;
const int INFi = 0x7f7f7f7f;
long long test = 1, n, x, a[N], b[N];
multiset<long long> sb;
void solve() {
  cin >> n >> x;
  for (int i = 0; i < n; i++) cin >> a[i];
  for (int i = 0; i < n; i++) cin >> b[i], sb.insert(b[i]);
  long long w = 0;
  for (int i = 0; i < n; i++) {
    auto it = sb.lower_bound(x - a[i]);
    if (it != sb.end()) {
      if (*it + a[i] >= x) w++;
      sb.erase(it);
    }
  }
  cout << 1 << " " << w << "\n";
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cout << fixed;
  cout << setprecision(10);
  ;
  for (int i = 1; i <= test; i++) {
    solve();
    string txt;
    cin >> txt;
  }
}
