#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
inline int power(int a, int b) {
    int x = 1;
    while (b) {
        if (b & 1) x *= a;
        a *= a;
        b >>= 1;
    }
    return x;
}


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

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

vector<int> a;

int getCost(int n, int k){
	vector<int> cost(n);
	for(int i=0; i<n; i++){
		cost[i] = a[i] + (i+1)*k; // 1 based indexing
	}
	
	sort(begin(cost), end(cost));
	
	int totalCost = 0;
	for(int i=0; i<k; i++){
		totalCost += cost[i];
	}
	
	return totalCost; 
}

bool isPossible(int n, int S, int mid){
	vector<int> cost(n);
	for(int i=0; i<n; i++){
		cost[i] = a[i] + (i+1)*mid;
	}
	
	sort(begin(cost), end(cost));
	int totalCost = 0;
	for(int i=0; i<mid; i++){
		totalCost += cost[i];
	}
	return totalCost <= S; 
}

pair<int,int> consistency(int n, int S){

	int s = 0, e = n;
	while(s<e){
		int mid = s + (e-s+1)/2;
		if(isPossible(n, S, mid)){
			s = mid;
		}
		else e = mid-1;
	}
	
	return {e, getCost(n, e)};

}








void solve() {
    
    int n, S;
    cin>>n >> S;
    
    a.resize(n);
    for(int i=0; i<n; i++) cin >> a[i];
    
    auto ans1 = consistency(n, S);
	
	cout << ans1.first << " " << ans1.second << 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;
}