#include <iostream>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>	// require sort next_permutation count __gcd reverse etc.
#include <cstdlib>	// require abs exit atof atoi 
#include <cstdio>		// require scanf printf
#include <functional>
#include <numeric>	// require accumulate
#include <cmath>		// require fabs
#include <climits>
#include <limits>
#include <cfloat>
#include <iomanip>	// require setw
#include <sstream>	// require stringstream 
#include <cstring>	// require memset
#include <cctype>		// require tolower, toupper
#include <fstream>	// require freopen
#include <ctime>		// require srand
#define rep(i,n) for(int i=0;i<(n);i++)
#define ALL(A) A.begin(), A.end()

using namespace std;

typedef long long ll;
typedef pair<int, int> P;

int main()
{
//	cut here before submit 
//	freopen ("testcase.DL", "r", stdin );
	int w;
	scanf ("%d", &w );
	vector<int> a (w+1, 0 );
	for (int i = 1; i <= w; i++ ) a[i] = i;
	int n;
	scanf ("%d", &n );
	rep (i, n ){
		string s = "";
		cin >> s;
		rep (j, s.length() ){
			if (s[j] == ',' ) s[j] = ' ';
		} // end rep
		stringstream ss (s );
		int b1, b2;
		ss >> b1 >> b2;
		swap (a[b1], a[b2] );
	} // end rep
	for (int i = 1; i <= w; i++ ){
		printf ("%d\n", a[i] );
	} // end for

	return 0;
}