#include <bits/stdc++.h>
using namespace std;
const long long INF = (long long)LLONG_MAX;
int dx[4] = {0, -1, 0, 1};
int dy[4] = {1, 0, -1, 0};
int dx8[9] = {1, 0, -1, 0, 1, -1, -1, 1, 0};
int dy8[9] = {0, 1, 0, -1, 1, -1, 1, -1, 0};
long long ipow(long long base, long long exp) {
  long long result = 1;
  while (exp) {
    if (exp & 1) result *= base;
    exp >>= 1;
    base *= base;
  }
  return result;
}
string tos(long long n) {
  stringstream ss;
  string ans;
  ss << n;
  ss >> ans;
  return ans;
}
long long toll(string n) { return atoll(n.c_str()); }
double dist(double x1, double y1, double x2, double y2) {
  return sqrt(((x1 - x2) * (x1 - x2)) + ((y1 - y2) * (y1 - y2)));
}
int doubleCompare(double x, double y) {
  if (fabs(x - y) <= 1e-5) return 0;
  if (x < y) return -1;
  return 1;
}
int a[10005];
int b[10005];
int main() {
  int n, k;
  cin >> n >> k;
  for (int i = 0; i < n; cin >> a[i++])
    ;
  for (int i = 0; i < n; cin >> b[i++])
    ;
  vector<pair<pair<int, int>, int> > nada;
  for (int i = 0; i < n; i++) {
    int nxt = ((b[i] / a[i]) + 1) * a[i];
    int now = b[i] / a[i];
    nada.push_back(make_pair(make_pair(now, nxt - b[i]), a[i]));
  }
  while (k) {
    sort(nada.begin(), nada.end());
    if (nada[0].first.second > k)
      break;
    else {
      nada[0].first.first++;
      k -= nada[0].first.second;
      nada[0].first.second = nada[0].second;
    }
  }
  sort(nada.begin(), nada.end());
  cout << nada[0].first.first << "\n";
}
