#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#define maxn 510
#define ll long long
using namespace std;
ll now,n,falg;
char s[100];
struct node{ll a,b,c;
}p[maxn];
ll init(){ll x=0,f=1;char s=getchar();while(s<'0'||s>'9'){if(s=='-')f=-1;s=getchar();}while(s>='0'&&s<='9'){x=x*10+s-'0';s=getchar();}return x*f;
}
ll Cal(ll x,ll y){if(x%y==0)return x/y;else return x/y+1;
}
int main()
{freopen("exercise.in","r",stdin);freopen("exercise.out","w",stdout);now=init();n=init();for(int i=1;i<=n;i++){+scanf("%s",s);//偷懒毁一生~ p[i].a=init();p[i].b=init();p[i].c=init();}for(int i=1;i<=n;i++){now+=p[i].a-p[i-1].b-1;if(now-(p[i].b-p[i].a+1)*p[i].c+p[i].b-p[i].a+1>0)now=now-(p[i].b-p[i].a+1)*p[i].c+p[i].b-p[i].a+1;else{now=Cal(now+p[i].a*p[i].c-p[i].a-p[i].c+1,p[i].c-1);falg=1;break;}}if(falg)cout<<"Runtime Error"<<endl<<now<<endl;else cout<<"Accepted"<<endl<<now+1440-p[n].b<<endl;return 0;
}

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define maxn 21
using namespace std;
int n,m,s,a[maxn],cnt,p=1,falg,c[maxn];
int cmp(int a,int b){return a>b;
}
void Dfs(int now){if(now==n+1){falg=1;return;}for(int i=1;i<=s&&i<=now;i++){//剪枝 if(c[i]+a[now]<=m){c[i]+=a[now];Dfs(now+1);if(falg)return;c[i]-=a[now];}}
}
int main()
{freopen("catclimb.in","r",stdin);freopen("catclimb.out","w",stdout);scanf("%d%d",&n,&m);for(int i=1;i<=n;i++)scanf("%d",&a[i]);sort(a+1,a+1+n,cmp);//大到小！这样规模小！ for(int i=1;i<=18;i++){memset(c,0,sizeof(c));s=i;Dfs(1);if(falg){cnt=i;break;}}printf("%d\n",cnt);return 0;
}

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define maxn 100010
#define lc k*2
#define rc k*2+1
#define mid (l+r)/2
using namespace std;
int n,m,a[maxn],b[maxn],c[maxn],s[maxn*4],num;
struct node{int x,y;char z;
}p[maxn];
int init(){int x=0,f=1;char s=getchar();while(s<'0'||s>'9'){if(s=='-')f=-1;s=getchar();}while(s>='0'&&s<='9'){x=x*10+s-'0';s=getchar();}return x*f;
}
void Insert(int k,int l,int r,int x,int y){if(l==x&&r==x){s[k]+=y;return;}if(x<=mid)Insert(lc,l,mid,x,y);else Insert(rc,mid+1,r,x,y);s[k]=s[lc]+s[rc];
}
int Query(int k,int l,int r,int x){if(l==r)return l;if(x>s[lc])return Query(rc,mid+1,r,x-s[lc]);else return Query(lc,l,mid,x);
}
int main()
{freopen("war.in","r",stdin);freopen("war.out","w",stdout);n=init();for(int i=1;i<=n;i++){a[i]=init();b[i]=a[i];c[++num]=a[i];}m=init();for(int i=1;i<=m;i++){cin>>p[i].z;p[i].x=init();if(p[i].z!='Q')p[i].y=init();if(p[i].z=='A'){b[p[i].x]-=p[i].y;if(b[p[i].x]>0)c[++num]=b[p[i].x];}if(p[i].z=='C'&&b[p[i].x]>0){b[p[i].x]+=p[i].y;c[++num]=b[p[i].x];}}sort(c+1,c+1+num);int pos,X,Y;num=unique(c+1,c+1+num)-c-1;for(int i=1;i<=n;i++){pos=lower_bound(c+1,c+1+num,a[i])-c;Insert(1,1,num,pos,1);}for(int i=1;i<=m;i++){if(p[i].z=='Q'){if(s[1]<p[i].x){printf("-1\n");continue;}pos=Query(1,1,num,s[1]-p[i].x+1);printf("%d\n",c[pos]);}if(p[i].z=='A'){X=a[p[i].x];a[p[i].x]-=p[i].y;pos=lower_bound(c+1,c+1+num,X)-c;Insert(1,1,num,pos,-1);Y=a[p[i].x];if(Y<=0)continue;pos=lower_bound(c+1,c+1+num,Y)-c;Insert(1,1,num,pos,1);}if(p[i].z=='C'){X=a[p[i].x];if(X<=0)continue;a[p[i].x]+=p[i].y;pos=lower_bound(c+1,c+1+num,X)-c;Insert(1,1,num,pos,-1);Y=a[p[i].x];pos=lower_bound(c+1,c+1+num,Y)-c;Insert(1,1,num,pos,1);}}printf("%d\n",s[1]);return 0;
}

#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#define maxn 5010
using namespace std;
int n,m,f[maxn][maxn/10],p[maxn],path[maxn];
vector<int>c[maxn],v[maxn];
int init(){int x=0,f=1;char s=getchar();while(s<'0'||s>'9'){if(s=='-')f=-1;s=getchar();}while(s>='0'&&s<='9'){x=x*10+s-'0';s=getchar();}return x*f;
}
void Dfs(int x,int y){if(x<=0)return;for(int i=0;i<=p[x];i++)if(f[x][y]==f[x-1][y-c[x][i]]+v[x][i]){path[x]=i+1;Dfs(x-1,y-c[x][i]);}
}
int main()
{freopen("diablo.in","r",stdin);freopen("diablo.out","w",stdout);n=init();m=init();int ci,vi;for(int i=1;i<=n;i++){ci=init();p[i]=init();for(int j=1;j<=p[i];j++){vi=init();c[i].push_back(ci*j);v[i].push_back(vi);}c[i].push_back(0);v[i].push_back(0);}for(int i=1;i<=n;i++)for(int j=m;j>=0;j--){int s=c[i].size();f[i][j]=f[i-1][j];for(int k=0;k<s;k++)if(j>=c[i][k])f[i][j]=max(f[i][j],f[i-1][j-c[i][k]]+v[i][k]);}printf("%d\n",f[n][m]);Dfs(n,m);for(int i=1;i<=n;i++)printf("%d\n",path[i]%(p[i]+1));return 0;
}