#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <time.h>
#include <cstdlib>
#include <cmath>
#include <fstream>

int main(void) {

	//test用
	//std::ifstream in("test.txt");
	//std::cin.rdbuf(in.rdbuf());

	int N, M;
	std::cin >> N >> M;

	std::vector<int> n(3);
	n[N - 1] = 1;

	for (int i = 0; i < M; i++) {
		int P, Q;
		std::cin >> P >> Q;

		int temp;
		temp = n[P - 1];
		n[P - 1] = n[Q - 1];
		n[Q - 1] = temp;
	}
	
	size_t index = std::distance(n.begin(),std::find(n.begin(), n.end(), 1));
	std::cout << index + 1 << std::endl;

}