#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b, int mod=M) {
    int x = 1;
    a %= mod;
    while (b) {
        if (b & 1) x = (x * a) % mod; 
        a = (a * a) % mod;
        b >>= 1;
    }
    return x;
}


//_ ***************************** START Below *******************************




vector<int> a;
vector<int> p;

int consistency1(int n, int c){

	vector<vector<int>> dp(n+1, vector<int>(c+1, 0));
	
	dp[0][0] = 0;
	
	for(int i=1; i<=n; i++){
		for(int j=0; j<=c; j++){
			
			int k = 0;
			while(j-k*a[i-1] >= 0){
				dp[i][j] = max(dp[i][j], dp[i-1][j-k*a[i-1]] + k*p[i-1]);
				k++;
			}
		}
	}
	
	return dp[n][c];
}



int consistency2(int n, int c){

	vector<vector<int>> dp(n+1, vector<int>(c+1, 0));
	
	dp[0][0] = 0;
	
	for(int i=1; i<=n; i++){
		for(int j=0; j<=c; j++){
			
			dp[i][j] = dp[i-1][j];
			if(j-a[i-1]>=0) dp[i][j] = max(dp[i][j], p[i-1] + dp[i][j-a[i-1]]);
		}
	}
	
	return dp[n][c];
}











int practice(int n){


    return 0;
}





void solve() {
    
    int n, c;
    cin>> n >> c;
    
    a.resize(n);
    p.resize(n);
    for(int i=0; i<n; i++) cin >> a[i];
    for(int i=0; i<n; i++) cin >> p[i];
    
    cout << consistency1(n, c) << " " << consistency2(n, c) << endl;


}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}