B-Queue on Bus Stop

Description

It's that time of the year when the Russians flood their countryside summer cottages (dachas) and the bus stop has a lot of people. People rarely go to the dacha on their own, it's usually a group, so the people stand in queue by groups.

The bus stop queue has n groups of people. The i-th group from the beginning has a_i people. Every 30 minutes an empty bus arrives at the bus stop, it can carry at most m people. Naturally, the people from the first group enter the bus first. Then go the people from the second group and so on. Note that the order of groups in the queue never changes. Moreover, if some group cannot fit all of its members into the current bus, it waits for the next bus together with other groups standing after it in the queue.

Your task is to determine how many buses is needed to transport all n groups to the dacha countryside.

Input

The first line contains two integers n and m(1 ≤ n, m ≤ 100). The next line contains n integers: a₁, a₂, ..., a_n(1 ≤ a_i ≤ m).

Output

Print a single integer — the number of buses that is needed to transport all n groups to the dacha countryside.

Sample Input

Input

4 3
2 3 2 1

Output

3

Input

3 4
1 2 1

Output

1

题目解析：第一个数告诉你有几组人，第二个数说明每辆车最多的承载人数，如果一个组不能全部上一个车，那就全部等下一辆。每一组人数不会超过车的最大承载量。

题目链接：http://acm.hust.edu.cn/vjudge/problem/visitOriginUrl.action?id=51001

源代码：

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
int ans=0;
int main()
{
    int n,m;
    int a[100];
    int i;
    scanf("%d%d",&n,&m);
    for(i=0;i<n;i++)
        scanf("%d",&a[i]);
    int now=m;
    for(i=0;i<n;)
    {
        if(a[i]<=now)
        {
            now=now-a[i];
            i++;
        }
        else
        {
            now=m;
            ans++;
        }
    }
    printf("%d\n",++ans);
    return 0;
}