#include <iostream>
#include <algorithm>
using namespace std;

#define ll long long
ll res_k, res_t, S;
ll mid, n, l, r;

ll readInt() {
    ll num = 0;
    char c = getchar();
    while (c != '-' && ('0' > c || '9' < c)) c = getchar();
    bool neg = false;
    if (c == '-') neg = true, c = getchar();
    for(num = 0; '0' <= c && c <= '9'; c = getchar()) num = (num << 1) + (num << 3) + (c - '0');
    if (neg) num = -num;
    return num;
}

struct Data {
    ll id, val;
} a[100001];

bool cmp(Data a, Data b) {
    return a.id * mid + a.val < b.id * mid + b.val;
}

ll check(ll k) {
    ll t = 0;
    for (int i = 1; i <= k; ++i) {
        t += a[i].id * k + a[i].val;
    }
    return (t > S?0:t);
    cout << k << ' ' << t << '\n';
}

void bs() {
    l = 1; r = n;
    mid = (l + r) >> 1;
    while (l <= r) {
        sort(a + 1, a + n + 1, cmp);
        ll tmp = check(mid);
        if (tmp) {
            res_k = mid;
            res_t = tmp;
            l = mid + 1;
        } else {
            r = mid - 1;
        }
        mid = (l + r) >> 1;
    }
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    
    n = readInt();
    S = readInt();
    for (int i = 1; i <= n; ++i) {
        a[i].val = readInt();
        a[i].id = i;
    }
    
    bs();
    cout << res_k << ' ' << res_t << '\n';
}