Codeforces Round #359 (Div. 2) A

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 ≤ 10⁹).

Each of the next n lines contains a character '+' or '-', and an integer d_i, separated by a space (1 ≤ d_i ≤ 10⁹). Record "+ d_i" in i-th line means that a carrier with d_i ice cream packs occupies i-th place from the start of the queue, and record "- d_i" means that a child who wants to take d_i 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.

题意：初始x个冰淇淋 按照操作符‘+’， ‘-’ 增减  统计最终剩余冰淇淋  和不能满足增减的次数

题解：水题

#include<bits/stdc++.h>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#define ll __int64
#define pi acos(-1.0)
using namespace std;
ll n,x,b;
char a;
int main()
{
    scanf("%I64d %I64d",&n,&x);
    ll sum=x;
    ll flag=0;
    for(int i=1;i<=n;i++)
    {
        getchar();
        scanf("%c %d",&a,&b);
        if(a=='+')
        sum+=b;
        if(a=='-')
        {
            if(sum>=b)
            sum-=b;
            else
            flag++;
        }    
    }
    cout<<sum<<" "<<flag<<endl;
    return 0;
}