#include "simurgh.h"
#ifndef EVAL
#include "grader.cpp"
#endif
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define NeedForSpeed ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef vector<int> vii;
typedef vector<pll> vpll;
typedef vector<pii> vpii;
template<class T> bool umin(T& a, const T& b) {return a > b? a = b, true:false;}
template<class T> bool umax(T& a, const T& b) {return a < b? a = b, true:false;}
int msb(int val){return sizeof(int)*8-__builtin_clzll(val)-1;}
const int N = 2500;
const int mod = 1e9+7;
const ll inf = 1e18;
const ld Pi = acos(-1);
int used[N], ue[N], ans, nn, mm;
vpii edges[N];
vii qq;
void dfs(int u){
used[u] = 1;
for(auto x:edges[u]){
if(used[x.ff]) continue;
ue[x.ss] = 1;
qq.pb(x.ss);
dfs(x.ff);
}
}
vii ss, res;
int fix[N];
void find (int u, pii gg, int p = -1){
if(!res.empty()) return;
if(u == gg.ff){
res = ss;
return;
}used[u] = 1;
for(auto x:edges[u]){
if(p == x.ff) continue;
if(ue[x.ss]){
ss.pb(x.ss);
find(x.ff, gg, u);
}
}ss.pop_back();
}
vector<int> find_roads(int n, vector<int> u, vector<int> v) {
nn = n, mm = sz(u);
for(int i=0;i<sz(u);i++){
edges[u[i]].pb({v[i], i});
edges[v[i]].pb({u[i], i});
//cout<<u[i]<<" "<<v[i]<<" "<<i<<"\n";
} //cout<<"\n";
dfs(0);
int ans = count_common_roads(qq);
vii rr;
//for(auto x:qq) cout<<u[x]<<" "<<v[x]<<" "<<x<<"\n";
//cout<<"\n";
for(int i=0;i<mm;i++){
if(ue[i]) continue;
ss.clear(), res.clear();
memset(used, 0, sizeof used);
find(u[i], {v[i], i});
ue[i] = 1;
vpii tres;
//cout<<i<<" ";
//for(auto x:res) cout<<x<<" ";
//cout<<"\n";
for(auto x:res){
ue[x] = 0;
vii tt;
for(int i=0;i<mm;i++) if(ue[i]) tt.pb(i);
int tmp = count_common_roads(tt);
tres.pb({tmp, x});
ue[x] = 1;
}
ue[i] = 0;
if(tres.empty()) continue;
tres.pb({ans, i});
sort(all(tres));
fix[tres[0].ss] = 2;
//for(auto x:tres) cout<<x.ff<<" ";
//cout<<"\n";
//for(auto x:tres) cout<<x.ss<<" ";
//cout<<"\n";
if(tres[0].ff == tres.back().ff){
for(auto x:tres) fix[x.ss] = 1;
continue;
}
for(int i=1;i<sz(tres);i++){
if(tres[i].ff == tres[0].ff) fix[tres[i].ss] = 2;
else fix[tres[i].ss] = 1;
}
//for(int i=0;i<mm;i++) cout<<fix[i]<<" ";
//cout<<"\n";
}
for(int i=0;i<mm;i++){
if(fix[i] == 2 || fix[i] == 0) rr.pb(i);
}//assert(sz(rr) >= n);
//cout<<"\n";
//for(auto x:rr) cout<<x<<" ";
//cout<<"\n";
return rr;
}
/*
5 7
0 1
0 2
1 2
2 3
2 4
3 4
1 4
1
2
3
4
7 21
2 0
0 1
5 2
2 6
1 3
3 0
6 0
4 5
3 2
4 0
1 4
0 5
4 3
4 6
6 1
2 1
5 3
2 4
5 6
5 1
6 3
7 10 9 13 12 17
1 10 7 2 0
0 0 0 -1 1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1
3 20 4 10 7 2
0 0 0 0 0 -1 -1 1 -1 -1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0
5 4 10 7 2 0
0 0 0 0 0 0 -1 1 -1 -1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0
6 20 4 10 7 2 0
0 0 0 0 0 0 0 1 -1 -1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0
8 4 10 7 2
0 0 0 0 0 0 0 1 0 -1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0
9 7 2 0
0 0 0 0 0 0 0 1 0 1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0
11 2 0
0 0 0 0 0 0 0 1 0 1 1 0 -1 -1 -1 -1 -1 -1 -1 -1 0
12 4 10
0 0 0 0 0 0 0 1 0 1 1 0 1 -1 -1 -1 -1 -1 -1 -1 0
13 20 4 10
0 0 0 0 0 0 0 1 0 1 1 0 1 1 -1 -1 -1 -1 -1 -1 0
14 20 4
0 0 0 0 0 0 0 1 0 1 1 0 1 1 0 -1 -1 -1 -1 -1 0
15 10 7 2
0 0 0 0 0 0 0 1 0 1 1 0 1 1 0 0 -1 -1 -1 -1 0
16 4 10 7
0 0 0 0 0 0 0 1 0 1 1 0 1 1 0 0 0 -1 -1 -1 0
17 7 2
0 0 0 0 0 0 0 1 0 1 1 0 1 1 0 0 0 1 -1 -1 0
18 20 4 10 7
0 0 0 0 0 0 0 1 0 1 1 0 1 1 0 0 0 1 0 -1 0
19 10 7
0 0 0 0 0 0 0 1 0 1 1 0 1 1 0 0 0 1 0 0 0
*/
