#include<bits/stdc++.h> 
int a[1000],b[1005];
int main()
{
    int i,j,k,n,m,biaoji;
    scanf("%d%d",&n,&m);
    for(i=1;i<=m;i++)
    {
     scanf("%d",&a[i]);
     b[i]=a[i];
    }
    for(j=1;j<=m;j++)
    {
    if(a[j]<n&&a[j+1]>=n)
       {
           biaoji=j+1;
           break;
       }
    }
    for(k=m;k>=biaoji;k--)
    {
    b[k+1]=a[k];
    }
    b[biaoji]=n;
    for(k=1;k<=m+1;k++)
    {
    printf("%d ",b[k]);
    }
    return 0;
}

#include<bits/stdc++.h> 
int a[1000],b[1005];
int main()
{
    int i,j,k,n,m,biaoji;
    scanf("%d%d",&n,&m);
    for(i=1;i<=m;i++)
    {
     scanf("%d",&a[i]);
     b[i]=a[i];
    }
    for(j=1;j<=m;j++)
    {
    if(a[j]<n&&a[j+1]>=n)
       {
           biaoji=j+1;
           break;
       }
    }
    for(k=m;k>=biaoji;k--)
    {
    b[k+1]=a[k];
    }
    b[biaoji]=n;
    for(k=1;k<=m+1;k++)
    {
    printf("%d ",b[k]);
    }
    return 0;
}

#include<bits/stdc++.h> 
using namespace std; 
int a[1145]; 
int main() { 
	int n,m,b=0;
	cin>>n>>m;
	for(int i=1;i<=m;i++){
		cin>>a[i];
	}
	a[m+1]=n;
	for(int i=1;i<=m+1;i++){
		for(int j=1;j<=m+1;j++){
			if(a[j]>a[j+1]){
				b=a[j];
				a[j]=a[j+1];
				a[j+1]=b;
			}
		}
	}
	for(int i=2;i<=m+2;i++){
		cout<<a[i]<<" ";
	}
	return 0; 
}

http://219.153.61.2:20004/p/1/solution