Go: package main

import (
	"bufio"
	"os"
	"strconv"
	"fmt"
	"strings"
)

var scanner = bufio.NewScanner(os.Stdin)

func nextInt() int {
	scanner.Scan()
	i, e := strconv.Atoi(scanner.Text())
	if e != nil {
		panic(e)
	}
	return i
}

func nextString() string {
	scanner.Scan()
	return scanner.Text()
}

func swap(ints []int, i, j int) {
	ints[i], ints[j] = ints[j], ints[i]
}

func main() {
	w := nextInt()
	// println(w)
	nums := make([]int, w)
	for i := range nums {
		nums[i] = i+1
	}
	n := nextInt()
	// println(n)
	for i := 0; i < n; i++ {
		info := nextString()
		// println(info)
		infos := strings.Split(info, ",")
		a, _ := strconv.Atoi(infos[0])
		b, _ := strconv.Atoi(infos[1])
		swap(nums, a-1, b-1)
	}
	for _, v := range nums {
		fmt.Println(v)
	}
}

C++: #include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <cmath>
using namespace std;

#define FOR(i,s,e) for (int i = int(s); i != int(e); i++)
#define REP(i,e) for (int i = 0; i != int(e); i++)
#define FORIT(i, A) for (auto i : A)
#define ISEQ(c) (c).begin(), (c).end()
#define PRINT(x) cout << (x) << endl
#define SZ(x) ((int)(x).size())

int main(int argc, char const *argv[])
{
	int w, n;
	scanf("%d", &w);
	scanf("%d", &n);
	vector<int> ans;
	REP(i, w)
		ans.push_back(i+1);
	REP(i, n)
	{
		int a,b;
		scanf("%d,%d", &a, &b);
		int temp = ans[a-1];
		ans[a-1] = ans[b-1];
		ans[b-1] = temp;
	}
	REP(i, SZ(ans))
	{
		printf("%d\n", ans[i]);
	}
	return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
  int w,n;
  int p;
  cin >> w >> n;
  int c[w];
  int a[n];
  int b[n];
  int j,j2;
  for(int i=0;i<w;i++) c[i] = i + 1;
 for(int i=0;i<n;i++) cin >> a[i] >> b[i];
 for(int i=0;i<n;i++){
   j = a[i] - 1;
   j2 = b[i] - 1;
   p = c[j];
   c[j] = c[j2];
   c[j2] = p;
 }  
 for(int i=0;i<w;i++) cout << c[i] << endl; 
 return 0;
}

C++: #include <iostream>
#include <cstdio>
using namespace std;

void initilize(int w,int num[]){
	for(int i=0;i<w;i++)
		num[i]=i+1;
}

int main() {
	int w,n,a,b;
	int num[30];
	cin>>w>>n;
	initilize(w,num);
	for(int i=0;i<n;i++){
		scanf("%d,%d",&a,&b);
		swap(num[a-1],num[b-1]);
	}
	for(int i=0;i<w;i++)
		cout<<num[i]<<endl;
	return 0;
}

C++: #include <iostream>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <algorithm>
#include <stdlib.h>

using namespace std;


int main(){

	int i, j;

	int w, n;

	cin >> w;
	cin >> n;

	int S[w];
	int a, b;
	int temp;

	for(i=0 ; i<w ; i++){
		S[i] = i+1;
	}

	for(i=0 ; i<n ; i++){
		scanf("%d,%d",&a, &b);
		temp = S[a-1];
		S[a-1] = S[b-1];
		S[b-1] = temp;
	}
	for(i=0 ; i<w ; i++){
		cout << S[i] << endl;
	} 

	return 0;
}

C++: //C++14 (Clang 3.8.0)

#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <string>
#include <climits>
#include <sstream>

using namespace std;
typedef pair<int,int> P;
vector<string> split(const string &s, char delim) {
    vector<string> elems;
    stringstream ss(s);
    string item;
    while (getline(ss, item, delim)) {
    if (!item.empty()) {
            elems.push_back(item);
        }
    }
    return elems;
}

int main(){
  int w,n;
  cin>>w;
  cin>>n;
  int ami[40];
  P bou[40];
  for(int i=0;i<n;i++){
    string s;
    cin>>s;
    vector<string> tmp=split(s,',');
    int x=0,y=0;
    int h=1;
    for(int j=0;j<tmp[0].size()-1;j++)h*=10;
    for(int j=0;j<tmp[0].size();j++){
      x+=(tmp[0][j]-48)*h;
      h/10;
    }
    h=1;
    for(int j=0;j<tmp[1].size()-1;j++)h*=10;
    for(int j=0;j<tmp[1].size();j++){
      y+=(tmp[1][j]-48)*h;
      h/=10;
    }
    bou[i]=P(x,y);
  }
  for (int i=0;i<w;i++){
    int start=i+1;
    for(int j=0;j<n;j++){
      if(bou[j].first==start){start=bou[j].second;}
      else if(bou[j].second==start){start=bou[j].first;}
    }
    ami[start]=i+1;
  }
  for(int i=1;i<=w-1;i++)cout<<ami[i]<<" ";
  cout<<ami[w]<<endl;






}

C++: #include "bits/stdc++.h"
using namespace std;

int main() {
	int W, N;
	vector<int> V;
	cin >> W >> N;
	for (int i = 1; i <= W; i++) {
		V.push_back(i);
	}
	for (int i = 0; i < N; i++) {
		int A, B;
		char C;
		cin >> A >> C >> B;
		A--, B--;
		swap(V[A], V[B]);
	}
	for (int i = 0; i < W; i++) {
		cout << V[i] << endl;
	}
}

C++: #include <iostream>
#include <vector>

using namespace std;
typedef pair<int, int> P;

void solve()
{
	int w, n;
	cin >> w >> n;
	vector<int> Pos(w + 1);
	vector<P> Vec(n);
	for(int i = 0; i < n; ++i)
	{
		scanf("%d,%d", &Vec[i].first, &Vec[i].second);
	}
	for(int i = 1; i <= w; ++i)
	{
		int pos = i;
		for(int j = 0; j < n; ++j)
		{
			if(Vec[j].first == pos)
			{
				pos = Vec[j].second;
			}
			else if(Vec[j].second == pos)
			{
				pos = Vec[j].first;
			}
		}
		Pos[pos] = i;
	}
	for(int i = 1; i <= w; ++i)
	{
		cout << Pos[i] << endl;
	}
}

int main()
{
	solve();
	return(0);
}

C++: #include <bits/stdc++.h>
#include <chrono>
using namespace std;

using _i64 = int64_t;
using _u64 = uint64_t;
using _f64 = double;

#define endl "\n"

#define _for(i, start, end) for(_i64 i = (_i64)start; i < (_i64)end; ++i)
#define _rep(i, number) _for(i, 0, number)
#define _foreach(e, data) for(auto& e : data)
#define _all(data) data.begin(), data.end()

template<typename type>
_i64 _size(const type& data) { return static_cast<_i64>(data.size()); }
template<typename type, size_t size>
_i64 _size(const type (&)[size]) { return static_cast<_i64>(size); }

enum _flag : bool { able = true, disable = false };

struct _time {
    _time(_flag flag) { check = flag; if(!check) { return; } gettime(start); }
    ~_time() {
        if(!check) { return; }; gettime(end);
        _i64 elapse = chrono::duration_cast<chrono::milliseconds>(end - start).count();
        cout << endl << "Time: " << elapse << " ms" << endl;
    }
    private:
    using _timer = chrono::time_point<chrono::system_clock>;
    _timer start, end; bool check;
    void gettime(_timer& time) { time = chrono::system_clock::now(); }
};

struct _ini { _ini() { ios::sync_with_stdio(false); cin.tie(nullptr); } } _ini;

int main() {
    {
        _time time(disable);
        _i64 w, n, a, b; vector<_i64> list;
        scanf("%ld", &w); list.resize(w); iota(_all(list), 1);
        scanf("%ld", &n);
        _rep(i, n) {
            scanf("%ld,%ld", &a, &b);
            swap(list[a - 1], list[b - 1]);
        }
        _foreach(e, list) { printf("%ld\n", e); }
    }
    return 0;
}

C++: #include<iostream>
#include<vector>
#include<cstdio>
using namespace std;
int main(){
  vector<int> lot;
  int n,m;
  cin >>n>>m;
  for(int i=1; i<=n; i++) lot.push_back(i);
  for(int i=0,a,b; i<m; i++){
    scanf("%d,%d",&a,&b);
    int c = lot[a-1];
    lot[a-1] = lot[b-1];
    lot[b-1] = c;
  }
  for(int i=0; i<n; i++) cout <<lot[i]<<endl;
  return 0;
}

C++: #include<iostream>
#include<vector>
#include <stdio.h>
int main(){
	int w;
	std::cin>>w;
	std::vector<int> a(w);
	for(int i=1;i<=w;i++)a[i]=i;
	int n;
	std::cin>>n;
	while(n>0){
		int b,c;
		scanf("%d,%d",&b,&c);
		//std::cin>>b>>c;
		int d=a[b];
		a[b]=a[c];
		a[c]=d;
		n--;
	}
	for(int i=1;i<=w;i++)std::cout<<a[i]<<std::endl;
	return 0;
}

C++: #include <iostream>
#include <cstdio>

#include <cmath>

#include <vector>

using namespace std;

int main(void)
{
	int w, n;

	cin >> w;
	cin >> n;

	vector<pair<int, int>> intersection(n);

	for(int i = 0; i < n; i++){
		scanf("%d,%d", &intersection[i].first, &intersection[i].second);
	}

	for(int i = 1; i <= w; i++){
		int r = i;
		for(const auto& x : intersection){
			if(x.first == r){
				r = x.second;
				break;
			}
			if(x.second == r){
				r = x.first;
				break;
			}
		}
		cout << r << endl;
	}

	return 0;
}