#pragma GCC optimize ("O3")

#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
#define int ll
typedef tree<
        pair<int, int>,
        null_type,
        less<pair<int, int>>,
        rb_tree_tag,
        tree_order_statistics_node_update>
        ordered_set;//order_of_key()->gives how many elements less than specific element in the set ,, find_by_order() ->find specific element by index the set
#define  ll long long
#define  el '\n'
#define IO       \
    ios_base::sync_with_stdio(0); \
    cin.tie(0);                   \
    cout.tie(0);

#define endl '\n'
using namespace std;

/*void test() {
    vector<int> tmp = {1,2,3,5};
     auto i = lower_bound(tmp.begin() + 1, tmp.end(),4);
     cout << *i << el;
}*/
signed main() {
    IO
    //freopen("i.txt", "r", stdin);
    //freopen("o.txt", "w", stdout);
    ll n,s,ss;
    cin>>n>>s;
    ss=s;
    int ans=0;
    while(n--)
    {
        string sss;
        cin>>sss;
        int a=(sss[0]-'0');
       // cout<<a<<"\n";
        if(sss.size()>1)
        {
            a++;
        }
        if(ss-a>=0)
        {
            ss-=a;
        }
        else
        {
            ans++;
            ss=s;
            ss-=a;
        }
    }
    cout<<ans;
}