#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; typedef long long int llint; typedef long double lldo; #define mp make_pair #define mt make_tuple #define pub push_back #define puf push_front #define pob pop_back #define pof pop_front #define fir first #define sec second #define res resize #define ins insert #define era erase //cout<void mineq(T& a,U b){if(a>b){a=b;}} template void maxeq(T& a,U b){if(a void SO(T& ve){sort(ve.begin(),ve.end());} template void REV(T& ve){reverse(ve.begin(),ve.end());} int LBI(vector&ar,lldo in){return lower_bound(ar.begin(),ar.end(),in)-ar.begin();} int UBI(vector&ar,lldo in){return upper_bound(ar.begin(),ar.end(),in)-ar.begin();} int main(void){ cin.tie(0); ios::sync_with_stdio(false); llint n,i;cin>>n; llint px,py;cin>>px>>py; llint gx,gy;gx=px;gy=py; vector>com(n); int tu=0; for(i=0;i>q; if(q==1){cin>>w;com[i]=mp(q,w);gx+=w;} if(q==2){cin>>w;com[i]=mp(q,w);gy+=w;} if(q==3){tu++;com[i]=mp(q,0);llint sx=gy,sy=-gx;gx=sx;gy=sy;} } for(i=0;i