CodeForces 686A Free Ice Cream

A. Free Ice Cream

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

After their adventure with the magic mirror Kay and Gerda have returned home and sometimes give free ice cream to kids in the summer.

At the start of the day they have x ice cream packs. Since the ice cream is free, people start standing in the queue before Kay and Gerda's house even in the night. Each person in the queue wants either to take several ice cream packs for himself and his friends or to give several ice cream packs to Kay and Gerda (carriers that bring ice cream have to stand in the same queue).

If a carrier with d ice cream packs comes to the house, then Kay and Gerda take all his packs. If a child who wants to take d ice cream packs comes to the house, then Kay and Gerda will give him d packs if they have enough ice cream, otherwise the child will get no ice cream at all and will leave in distress.

Kay wants to find the amount of ice cream they will have after all people will leave from the queue, and Gerda wants to find the number of distressed kids.

Input

The first line contains two space-separated integers n and x (1 ≤ n ≤ 1000, 0 ≤ x ≤ 109).

Each of the next n lines contains a character '+' or '-', and an integer di, separated by a space (1 ≤ di ≤ 109). Record "+ di" in i-th line means that a carrier with di ice cream packs occupies i-th place from the start of the queue, and record "- di" means that a child who wants to take di packs stands in i-th place.

Output

Print two space-separated integers — number of ice cream packs left after all operations, and number of kids that left the house in distress.

Examples

input

5 7+ 5- 10- 20+ 40- 20

output

22 1

input

5 17- 16- 2- 98+ 100- 98

output

3 2

Note

Consider the first sample.

1. Initially Kay and Gerda have 7 packs of ice cream.
2. Carrier brings 5 more, so now they have 12 packs.
3. A kid asks for 10 packs and receives them. There are only 2 packs remaining.
4. Another kid asks for 20 packs. Kay and Gerda do not have them, so the kid goes away distressed.
5. Carrier bring 40 packs, now Kay and Gerda have 42 packs.
6. Kid asks for 20 packs and receives them. There are 22 packs remaining.
7. 题意：最开始有n个人排队（里面包括送冰激凌的，和要带走冰激凌的）和x个冰激凌，下面N行是冰激凌带走和送来的情况，“+”送来，‘-“，带走，
8. 如果要带走的数量多于现有的冰激凌数量，那么他一个也不能带走，并且会很失望，求最后的冰激凌数量和失望的人数。
9. 思路：模拟即可。

10. #include<cstdio>#include<cstring>#include<algorithm>#include<iostream>using namespace std;int main(){    int n,i,ans;    __int64 num,x,a;    char str[10];    while(scanf("%d%I64d",&n,&x)!=EOF)    {        ans=0;        num=x;        for(i=0;i<n;i++)        {            scanf("%s%I64d",str,&a);            if(str[0]=='+')            num+=a;            else            {                if(num<a)                ans++;                else                num=num-a;            }        }        printf("%I64d %d\n",num,ans);    }    return 0;}