Problem:
Drawing Lots

Let's play Amidakuji.

In the following example, there are five vertical lines and four horizontal lines. The horizontal lines can intersect (jump across) the vertical lines.

In the starting points (top of the figure), numbers are assigned to vertical lines in ascending order from left to right. At the first step, 2 and 4 are swaped by the first horizontal line which connects second and fourth vertical lines (we call this operation (2, 4)). Likewise, we perform (3, 5), (1, 2) and (3, 4), then obtain "4 1 2 5 3" in the bottom.

Your task is to write a program which reads the number of vertical lines w and configurations of horizontal lines and prints the final state of the Amidakuji. In the starting pints, numbers 1, 2, 3, ..., w are assigne to the vertical lines from left to right.

Input

w
n
a1,b1
a2,b2
.
.
an,bn

w (w ≤ 30) is the number of vertical lines. n (n ≤ 30) is the number of horizontal lines. A pair of two integers ai and bi delimited by a comma represents the i-th horizontal line.

Output

The number which should be under the 1st (leftmost) vertical line

The number which should be under the 2nd vertical line

:

The number which should be under the w-th vertical line

Sample Input

5
4
2,4
3,5
1,2
3,4

Output for the Sample Input

4
1
2
5
3

Solution in Ruby (judge verdict: Wrong Answer)

#encoding:utf-8
=begin
配列に数字を入れ、横棒が来たら並べ替える。最後に配列を出力する。
=end

#まずは入力を処理する。配列に入れる。
numbers = gets.chomp
num_ary = []
numbers.to_i.times do |i|
 num_ary.push i+1
end

change = gets.chomp
j = 0
ch_ary = []
while j < change.to_i
 ch_ary.push gets
 j += 1
end

#次に、num_aryの中身をch_aryにしたがって並び替える。
ch_idx = 0
while ch_idx < ch_ary.length
 num_idx1 = ch_ary[ch_idx][0].to_i - 1
 num_idx2 = ch_ary[ch_idx][2].to_i - 1
 num_ary[num_idx1] , num_ary[num_idx2] = num_ary[num_idx2] , num_ary[num_idx1]
 ch_idx += 1
end

puts num_ary