#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
using std::chrono::high_resolution_clock;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int>pi;
typedef pair<ll, ll>pl;
typedef vector<pi>vpi;
typedef vector<pl>vpl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<string> vs;
const double PI = acos(-1);
const int oo = 1e17 + 7;
const int MOD = 1e9 + 7;
const int N = 1e6 + 1;
#define endl '\n'
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define read(v) for (auto& it : v) scanf("%d", &it);
#define readL(v) for (auto& it : v) scanf("%lld", &it);
#define print(v) for (auto it : v) printf("%d ", it); puts("");
#define printL(v) for (auto it : v) printf("%lld ", it); puts("");
auto Time() {
	return high_resolution_clock::now();
}
void solve() {
	int n, s;
	scanf("%d %d", &n, &s);
	vi t(n), r(n), dif(n);
	read(t);
	read(r);
	for (int i = 0; i < n; i++)
		dif[i] = (r[i] - t[i]);
	sort(rall(dif));
	int ans = 1;
	for (int i = 0; i < n; i++) {
		s += dif[i];
		if (s <= 0)
			break;
		ans++;
	}
	printf("%d\n", ans);
}
int t = 1;
int main() {
#ifndef ONLINE_JUDGE
	freopen("input.txt", "r", stdin);
#endif
	//scanf("%d", &t);
	while (t--) solve();
}