A. Free Ice Cream



time limit per test



memory limit per test



input



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.

x

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

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



n and x (1 ≤ n ≤ 1000, 0 ≤ x ≤ 109).

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. 7
  2. 5 more, so now they have 12
  3. 10 packs and receives them. There are only 2
  4. 20
  5. 40 packs, now Kay and Gerda have 42
  6. 20 packs and receives them. There are 22



水题 

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
using namespace std;
typedef long long ll;
int main()
{
    ll n,x,s=0,m;
    char str;
    cin>>n>>x;
    for(int i=0;i<n;i++)
    {
        cin>>str>>m;
        if(str=='+')
            x+=m;
        else
        {
            if(x>=m)
                x-=m;
            else
                s++;
        }
    }
    cout<<x<<" "<<s<<endl;
    return 0;
}