//#define _GLIBCXX_DEBUG #include using namespace std; #define endl '\n' #define lfs cout<= (ll)(n); i--) using ll = long long; using ld = long double; const ll MOD1 = 1e9+7; const ll MOD9 = 998244353; const ll INF = 1e18; using P = pair; template using PQ = priority_queue; template using QP = priority_queue,greater>; templatebool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;} templatebool chmax(T1 &a,T2 b){if(avoid ans(bool x,T1 y,T2 z){if(x)cout<void anss(T1 x,T2 y,T3 z){ans(x!=y,x,z);}; templatevoid debug(const T &v,ll h,ll w,string sv=" "){for(ll i=0;ivoid debug(const T &v,ll n,string sv=" "){if(n!=0)cout<void debug(const vector&v){debug(v,v.size());} templatevoid debug(const vector>&v){for(auto &vv:v)debug(vv,vv.size());} templatevoid debug(stack st){while(!st.empty()){cout<void debug(queue st){while(!st.empty()){cout<void debug(deque st){while(!st.empty()){cout<void debug(PQ st){while(!st.empty()){cout<void debug(QP st){while(!st.empty()){cout<void debug(const set&v){for(auto z:v)cout<void debug(const multiset&v){for(auto z:v)cout<void debug(const array &a){for(auto z:a)cout<void debug(const map&v){for(auto z:v)cout<<"["<vector>vec(ll x, ll y, T w){vector>v(x,vector(y,w));return v;} ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;} vectordx={1,-1,0,0,1,1,-1,-1};vectordy={0,0,1,-1,1,-1,1,-1}; templatevector make_v(size_t a,T b){return vector(a,b);} templateauto make_v(size_t a,Ts... ts){return vector(a,make_v(ts...));} templateostream &operator<<(ostream &os, const pair&p){return os << p.first << " " << p.second;} templateostream &operator<<(ostream &os, const vector &v){for(auto &z:v)os << z << " ";cout<<"|"; return os;} templatevoid rearrange(vector&ord, vector&v){ auto tmp = v; for(int i=0;ivoid rearrange(vector&ord,Head&& head, Tail&&... tail){ rearrange(ord, head); rearrange(ord, tail...); } template vector ascend(const vector&v){ vectorord(v.size());iota(ord.begin(),ord.end(),0); sort(ord.begin(),ord.end(),[&](int i,int j){return v[i] vector descend(const vector&v){ vectorord(v.size());iota(ord.begin(),ord.end(),0); sort(ord.begin(),ord.end(),[&](int i,int j){return v[i]>v[j];}); return ord; } ll FLOOR(ll n,ll div){assert(div>0);return n>=0?n/div:(n-div+1)/div;} ll CEIL(ll n,ll div){assert(div>0);return n>=0?(n+div-1)/div:n/div;} ll digitsum(ll n){ll ret=0;while(n){ret+=n%10;n/=10;}return ret;} ll modulo(ll n,ll d){return (n%d+d)%d;}; templateT min(const vector&v){return *min_element(v.begin(),v.end());} templateT max(const vector&v){return *max_element(v.begin(),v.end());} templateT acc(const vector&v){return accumulate(v.begin(),v.end(),T(0));}; templateT reverse(const T &v){return T(v.rbegin(),v.rend());}; //mt19937 mt(chrono::steady_clock::now().time_since_epoch().count()); int popcount(ll x){return __builtin_popcountll(x);}; int poplow(ll x){return __builtin_ctzll(x);}; int pophigh(ll x){return 63 - __builtin_clzll(x);}; templateT poll(queue &q){auto ret=q.front();q.pop();return ret;}; templateT poll(priority_queue &q){auto ret=q.top();q.pop();return ret;}; templateT poll(QP &q){auto ret=q.top();q.pop();return ret;}; templateT poll(stack &s){auto ret=s.top();s.pop();return ret;}; ll MULT(ll x,ll y){if(LLONG_MAX/x<=y)return LLONG_MAX;return x*y;} ll POW2(ll x, ll k){ll ret=1,mul=x;while(k){if(mul==LLONG_MAX)return LLONG_MAX;if(k&1)ret=MULT(ret,mul);mul=MULT(mul,mul);k>>=1;}return ret;} ll POW(ll x, ll k){ll ret=1;for(int i=0;i struct edge { int to; T cost; int id; edge():id(-1){}; edge(int to, T cost = 1, int id = -1):to(to), cost(cost), id(id){} operator int() const { return to; } }; template using Graph = vector>>; template Graphrevgraph(const Graph &g){ Graphret(g.size()); for(int i=0;i Graph readGraph(int n,int m,int indexed=1,bool directed=false,bool weighted=false){ Graph ret(n); for(int es = 0; es < m; es++){ int u,v; T w=1; cin>>u>>v;u-=indexed,v-=indexed; if(weighted)cin>>w; ret[u].emplace_back(v,w,es); if(!directed)ret[v].emplace_back(u,w,es); } return ret; } template Graph readParent(int n,int indexed=1,bool directed=true){ Graphret(n); for(int i=1;i>p; p-=indexed; ret[p].emplace_back(i); if(!directed)ret[i].emplace_back(p); } return ret; } template struct HLD{ using D=long long; int n; vectorsz;//部分木サイズ vectordep; vectorpar; vectorhead; Graph &g;//隣接リスト vector>edges;//データ構造に乗せるedge列 vectorin,out;//[in,out)で部分木、[ina,inb]でa~bのパス(aが上) vectorcomp;//連結成分の根 vectorhc; //inは頂点のindexを表す。また、edge列の下側の頂点である HLD(Graph &g,int r=-1):g(g),n(g.size()){ hld_build(r); } void hld_build(int root = -1){ in.assign(n,-1);out.assign(n,-1);dep.assign(n,0); par.assign(n,-1);head.assign(n,-1);sz.assign(n,-1);comp.assign(n,-1); edges.assign(n,edge()); hc.assign(n,-1); if(root == -1){//根がどこでも良い場合(森でも可) for(int i=0;i sz[g[k][0].to])swap(e, g[k][0]); } } int time = 0; void dfs_hld(int k){ in[k] = time++; for(auto e:g[k]){ if(e.to == par[k])continue; head[e.to] = (e.to == g[k][0].to ? head[k]: e.to); if(head[e.to]==head[k])hc[k]=e.to; edges[time] = e; dfs_hld(e.to); } out[k] = time; } int lca(int p,int q){ while(1){ if(in[p] < in[q])swap(p,q); if(head[p] == head[q])return q; p = par[head[p]]; } } vector>query_path(int p,int q,bool isEdge){ int r=lca(p,q); vector>ret; for(int i=0;i<2;i++){ if(i == 1)swap(p,q); while(1){ if(isEdge&&p==r)break; if(head[p]==head[r]){ ret.emplace_back(in[r]+(isEdge?1:i),in[p]+1); break; } ret.emplace_back(in[head[p]],in[p]+1); p = par[head[p]]; } } return ret; } vector>>query_order_path(int p,int q,bool isEdge){ //非可換クエリ用、配列0を順番を反転したデータ構造に、配列1を通常のデータ構造に vector>>ret(2); int r=lca(p,q); for(int i=0;i<2;i++){ if(i == 1)swap(p,q); while(1){ if(isEdge&&p==r)break; if(head[p]==head[r]){ if(i==0) ret[i].emplace_back(n-(in[p]+1),n-(in[r]+(isEdge?1:i))); else ret[i].emplace_back(in[r]+(isEdge?1:i),in[p]+1); break; } if(i==0) ret[i].emplace_back(n-(in[p]+1),n-(in[head[p]])); else ret[i].emplace_back(in[head[p]],in[p]+1); p = par[head[p]]; } } reverse(ret[1].begin(), ret[1].end()); return ret; } pairquery_subtree(int p,bool isEdge){ return make_pair(in[p]+isEdge,out[p]); } //uのv方向の子 子孫関係は前もって確認すること(in,outを見る) int child(int u,int v){ while(1){ if(head[u]==head[v]){ v=g[u][0].to; break; } v=head[v]; if(par[v]==u)break; v=par[v]; } return v; } //uをv方向に一つ進めた頂点 int move(int u,int v){ assert(u!=v); if(in[u]rev_in; int climb(int u,int k){ if(rev_in.empty()){ rev_in.resize(n); for(int i=0;i(dep[u]-k, 0); while(dep[u]>nd){ if(dep[head[u]]>nd){ u=par[head[u]]; } else{ u=rev_in[in[head[u]]+nd-dep[head[u]]]; } } return u; } template Graphlca_tree(vector&v){ auto compare=[&](int x,int y){return in[x]ret(sz2); stackst; for(int i=0;i>n; auto g=readGraph(n,n-1); vectorrev(n); HLD hld(g,0); rep(i,0,n)rev[hld.in[i]]=i; using pi=pair; auto comp_down=[&](int x,int y){ return hld.in[x]hld.in[y]; }; setup(comp_up); setdown(comp_down); vector>cs(n); vectora(n); rep(i,0,n)a[i]=MP(i,i); rep(i,1,n){ cs[hld.par[i]].insert(a[i]); } auto recalc=[&](int v){ if(v!=hld.head[v]&&cs[v].size()>=2){ if(up.count(v))up.erase(v); auto it=cs[v].rbegin(); if(it->se==hld.hc[v])it++; if(it->fi>a[hld.par[v]].fi)up.insert(v); } if(hld.hc[v]!=-1&&!cs[v].empty()){ if(down.count(v))down.erase(v); auto it=cs[v].rbegin(); if(it->fi>a[hld.hc[v]].fi)down.insert(v); } }; rep(i,0,n){ if(i==hld.head[i]){ up.insert(i); } if(hld.hc[i]==-1){ down.insert(i); } recalc(i); } int q;cin>>q; assert(n*q<=1000000); int last=0; while(q--){ int u,v;cin>>u>>v; u=(u-1+last)%n; v=(v-1+last)%n; //cout<int{ int ret=-1; if(hld.par[u]!=-1&&hld.par[u]!=pre){ auto it=cs[u].rbegin(); if(!cs[u].empty()&&it->se==pre)it++; if(it==cs[u].rend()||it->fise; } } else if(!cs[u].empty()){ auto it=cs[u].rbegin(); if(it->se==pre)it++; if(it!=cs[u].rend())ret=it->se; } return ret; }; { int nxt=get(); pre=u; u=nxt; } while(1){ int tmp=get(); //if(q==14)cout<