#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
using namespace std;
using ll =long long;
void solve(){
    ll N,M;cin >> N >> M;
    int a[3]={0,0,0};
    a[N-1]++;
    for(ll i=0;i<M;i++){
        ll p,q;cin >> p >> q;
        swap(a[p-1],a[q-1]);
    }
    for(ll j=0;j<3;j++){
        if(a[j]==1){
            cout << j+1 << endl;
        }
    }
    return;
}
int main(){
    solve();
    return 0;
}