#include #include #include #include #include #include #include #include #include #include #include using namespace std; #define int long long #define FOR(i, a, b) for(int i=(a);i<(b);i++) #define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--) #define REP(i, n) for(int i=0; i<(n); i++) #define RREP(i, n) for(int i=(n-1); i>=0; i--) #define ALL(a) (a).begin(),(a).end() #define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end()); #define CONTAIN(a, b) find(ALL(a), (b)) != (a).end() #define SUM(a) accumulate(ALL(a), 0) #define array2(type, x, y) array, x> #define vector2(type) vector > #define out(...) printf(__VA_ARGS__) /*================================*/ int N, M; signed main() { cin >> N >> M; vector c(3, false); c[--N] = true; int P, Q; REP(i,M) { cin >> P >> Q; swap(c[P-1], c[Q-1]); } REP(i,3) if (c[i]) cout << i + 1 << endl; return 0; }