A

#include <bits/stdc++.h>


using namespace std;

#define int long long

const long long INF = 1e9 + 7;
const int MAXN = 200 + 10;
const int N = 1e5 + 10;

int n, p;
vector<int> a;

//pair<int, int> min_sum(int pos) {
//    int l = pos, sum = 0;
//    bool flag = true;
//    for (int r = pos; r < pos || flag; ++r) {
//        flag = false;
//
//    }
//}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    cin >> n >> p;
    a.resize(n);
    int sum = 0;
    vector<int> pref(n + 1, 0);
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
        sum += a[i];
        pref[i + 1] = pref[i] + a[i];
    }
    int ans = n * (p / sum);
    p %= sum;
    if (p == 0) {
        cout << 1 << ' ' << ans << '\n';
        return 0;
    }

    int res = INF, start;
    for (int l = 0; l < n; ++l) {
        for (int r = 0; r < n; ++r) {
            int summ = 0, kol;
            if (l <= r) {
                summ = pref[r + 1] - pref[l];
                kol = r - l + 1;
            } else {
                summ = pref[r + 1] + pref[n] - pref[l];
                kol = (r + 1) + (n - l);
            }
            if (summ >= p && res > kol) {
                res = kol;
                start = l;
            }
        }
    }
    cout << start + 1 << ' ' << ans + res << '\n';
}