#include <bits/stdc++.h>
using namespace std;const int N = 1e5 + 5;
int n,f[90 * N],ls[90 * N],rs[90 * N],size[90 * N],root[N];
int cnt,m,fa[N];int build(int o, int l ,int r) {int nd = ++ cnt;if(l == r) {f[nd] = l; size[nd] = 1;return nd;}int mid = (l + r) >> 1;ls[nd] = build(2 * o, l, mid);rs[nd] = build(2 * o + 1, mid + 1, r);return nd;
}void Init( ) {scanf("%d%d",& n,& m);root[0] = build(1, 1, n);
}int modify_fa(int pre, int o, int l, int r, int pos, int del) {int nd = ++ cnt;f[nd] = f[pre],ls[nd] = ls[pre],rs[nd] = rs[pre],size[nd] = size[pre];if(l == r) {f[nd] = del; return nd;}int mid = (l + r) >> 1;if(pos <= mid) {ls[nd] = modify_fa(ls[pre], 2 * o, l, mid, pos, del);}else rs[nd] = modify_fa(rs[pre], 2 * o + 1, mid + 1, r, pos, del);return nd;
}int modify_size(int pre, int o, int l, int r, int pos, int del) {int nd = ++ cnt;f[nd] = f[pre],ls[nd] = ls[pre],rs[nd] = rs[pre],size[nd] = size[pre] + del;if(l == r) {return nd;}int mid = (l + r) >> 1;if(pos <= mid) {ls[nd] = modify_size(ls[pre], 2 * o, l, mid, pos, del);}else rs[nd] = modify_size(rs[pre], 2 * o + 1, mid + 1, r, pos, del);return nd;
}int query_fa(int nd, int o, int l, int r, int pos) {if(l == r) {return f[nd];}int mid = (l + r) >> 1;if(pos <= mid) return query_fa(ls[nd], 2 * o, l, mid, pos);else return query_fa(rs[nd], 2 * o + 1, mid + 1, r, pos);
}int query_size(int nd, int o, int l, int r, int pos) {if(l == r) {return size[nd];}int mid = (l + r) >> 1;if(pos <= mid) return query_size(ls[nd], 2 * o, l, mid, pos);else return query_size(rs[nd], 2 * o + 1, mid + 1, r, pos);
}int Find_fa(int x, int M) {int ff = query_fa(root[x], 1, 1, n, M);if(ff == M) return ff;int F = Find_fa(x, ff);return F;
}void Solve( ) {int las = 0;for(int i = 1;i <= m;i ++){int opt,x,y;scanf("%d",& opt);if(opt == 1) {scanf("%d%d",& x,& y); x = x + las, y = y + las;int fa1 = Find_fa(i - 1, x), fa2 = Find_fa(i - 1, y);if(fa1 == fa2) {root[i] = root[i - 1]; continue;}int s1 = query_size(root[i - 1], 1, 1, n, fa1);int s2 = query_size(root[i - 1], 1, 1, n, fa2);if(s1 < s2) { swap(s1,s2); swap(fa1, fa2); }root[i] = modify_fa(root[i - 1], 1, 1, n, fa2, fa1);root[i] = modify_size(root[i], 1, 1, n, fa1, s2);}else {scanf("%d%d",& x,& y); x = x + las, y = y + las;root[i] = root[i - 1]; int fat = Find_fa(x, y);int s = query_size(root[x], 1, 1, n, fat);printf("%d\n",s); las = s;}  }
}int main( ) {freopen("build.in","r",stdin);freopen("build.out","w",stdout);Init( );Solve( );
}

#include <bits/stdc++.h>
using namespace std;typedef long long ll;
const int N = 1e5 + 5;
int n;
ll dp[N][2][2],sum[N],a[N];void Init( ) {scanf("%d",& n);for(int i = 1;i <= n;i ++) {scanf("%lld",& a[i]);sum[i] = sum[i - 1] + a[i];}
}void Solve( ) {dp[n][1][1] = a[n], dp[n][0][1] = a[n];for(int i = n - 1;i >= 1;i --) {for(int now = 0;now <= 1;now ++) {dp[i][now][1] = a[i] + sum[n] - sum[i] - max(dp[i + 1][now ^ 1][0], dp[i + 1][now ^ 1][1]);dp[i][now][0] = max(dp[i + 1][now][1], dp[i + 1][now][0]);}}printf("%lld\n",max(dp[1][1][1], dp[1][1][0]));
}int main( ) {freopen("distribute.in","r",stdin);freopen("distribute.out","w",stdout);Init( );Solve( );
}

#include <bits/stdc++.h>
using namespace std;const int N = 1e5 + 5;
int n,head[N],nex[2 * N],tov[2 * N],id[2 * N],c[N];
int dfn[N],low[N],idc,tot = 1,m,stk[2 * N],top,col,que[2 * N];
bool vis[2 * N],isans[2 * N];void add(int u, int v, int ID) {tot ++;nex[tot] = head[u];tov[tot] = v; id[tot] = ID;head[u] = tot;
}void Init( ) {scanf("%d%d",& n,& m);for(int i = 1;i <= m;i ++) {int u,v;scanf("%d%d",& u,& v);add(u, v, i); add(v, u, i);}
}void tarjan(int u,int from) {low[u] = dfn[u] = ++idc;for(int i = head[u];i;i = nex[i]) {int v = tov[i];if((i ^ 1) == from) continue;if(! vis[i]) vis[i] = vis[i ^ 1] = true, stk[++ top] = i;if(! dfn[v]) {tarjan(v, i);low[u] = min(low[u], low[v]);if(low[v] >= dfn[u]) {col ++; int cntn = 0,cnte = 0;while(1) {int e = stk[top --];if(c[tov[e]] != col) c[tov[e]] = col,cntn ++;if(c[tov[e ^ 1]] != col) c[tov[e ^ 1]] = col, cntn ++;que[++ cnte] = e;if(e == i) break;}if(cnte == cntn) {for(int i = 1;i <= cnte;i ++) isans[que[i]] = isans[que[i] ^ 1] = true;}}}else if(low[u] > dfn[v]) low[u] = min(low[u], dfn[v]);}
}void Solve( ) {for(int i = 1;i <= n;i ++) {if(! dfn[i]) tarjan(i, 0);}int ans = 0;for(int i = 2;i <= tot;i += 2) if(isans[i]) ans ++;printf("%d\n",ans);for(int i = 2;i <= tot;i += 2) if(isans[i]) printf("%d ",i / 2);
}int main( ) {freopen("find.in","r",stdin);freopen("find.out","w",stdout);Init( );Solve( );
}