#include<bits/stdc++.h>
#define ll long long
#define el '\n'
#define all(a) a.begin(),a.end()

#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;
template<typename T>

using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const ll N=1e5+5,mod=1e9+7;


void solve(ll t)
{
    int n, s;
    cin >> n >> s;

    int ans = 0, tmp = s;
    for (int i = 0; i < n; i++) {
        string ss;
        cin >> ss;

        if (ss.size() == 1)
            tmp -= ss[0] - '0';
        else
            tmp -= ss[0] - '0' + 1;

        if (tmp < 0)
            ans++, tmp += s;
    }

    cout << ans << el;
}

int main() {
    ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    ll t;
    //cin >> t;
    t = 1;
    for (ll i = 0 ; i < t ; i ++)
    {
        solve(t);
    }
}