/* Solution to ghostleg written by Larry Pyeatt */
#include <stdio.h>
int main()
{
  int i,tmp,n,m,rung;
  int mapping[100];
  scanf("%d%d",&n,&m);
  for(i=0;i<n;i++)
    mapping[i]=i+1; /* initialize permutation to 1,2,3,... */
  for(i=0;i<m;i++)
    {
      scanf("%d",&rung);
      tmp=mapping[rung-1];       /* apply the permutation */
      mapping[rung-1] = mapping[rung];
      mapping[rung] = tmp;
    }
  for(i=0;i<n;i++)
    printf("%d\n",mapping[i]);
  return 0;
}