#include <bits/stdc++.h>

#define el '\n'
#define ll long long
#define ld long double

#define Beevo ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

using namespace std;

void testCase() {
    int n, s;
    cin >> n >> s;

    int p = s;

    string t;
    int cnt = 0;
    for (int i = 0; i < n; i++) {
        cin >> t;

        if (t.size() == 1)
            s -= t[0] - '0';
        else
            s -= t[0] - '0' + 1;

        if (s < 0)
            cnt++, s += p;
    }

    cout << cnt;
}

signed main() {
    Beevo

    int T = 1;
//    cin >> T;

    while (T--)
        testCase();

    return 0;
}