#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <algorithm>
#include <utility>
#include <functional>
#include <sstream>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <climits>
using namespace std;
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v;}
template<class T> inline string toStr(T x) { ostringstream sout; sout << x; return sout.str();}
typedef vector<int> vi;
typedef vector<vi>  vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define REP(i,n) FOR(i,0,(n)-1)
const double EPS = 1e-12;
const double PI = acos(-1.0);
const int INF = INT_MAX/10;

int main() {
	int w, n;
	while(cin >> w) {
		cin >> n;
		vvi bar(n, vi(2));
		
		int a, b;
		char c;
		REP(i, n) {
			cin >> a >> c >> b;
			bar[i][0] = a;
			bar[i][1] = b;
		}

		vi goal(w);
		FOR(i, 1, w) {
			int cur = i;
			REP(j, n) {
				if(bar[j][0] == cur) {
					cur = bar[j][1];
					goto next;
				}
				if(bar[j][1] == cur) {
					cur = bar[j][0];
					goto next;
				}

				next:;
			}
			
			goal[cur-1] = i;
		}

		REP(i, w) {
			cout << goal[i] << endl;
		}
	}
}