#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
using namespace std;

int max(int a, int b) {
	int x = (a > b) ? a : b;
	return x;
}

int min(int a, int b) {
	int x = (a < b) ? a : b;
	return x;
}

int binary_search(int n, vector<int> v,int key) {
	int left=0, right=n;

	while (left < right) {
		int mid = (left + right) / 2;
		if (v[mid] == key) return mid;
		else if (v[mid] < key) {
			left = mid + 1;
		}
		else if (v[mid] > key) {
			right = mid - 1;
		}
	}
}

int main() {
	int n, m;
	int cup[3] = { 0 };
	int p, q;
	cin >> n >> m;
	cup[n - 1] = 1;

	for (int i = 0; i < m; i++) {
		cin >> p >> q;
		int swap;
		swap = cup[p - 1];
		cup[p - 1] = cup[q - 1];
		cup[q - 1] = swap;
	}

	for (int i = 0; i < 3; i++)
		if (cup[i] == 1) cout << i + 1 << endl;
	return 0;
}