#include<stdio.h> int main() { int q[102],n, m; while (scanf("%d%d", &n, &m) != EOF && n||m) { int i,j,u=0,t,k=0; //录入数组 for (i = 0; i <n; i++) { scanf("%d", &q[i]); } //将所有数组向后移动,再将m赋值给第一个 for (i = n-1; i >= 0;i--) q[i + 1] = q[i]; q[0] = m; //准备用起泡法进行排序 for(j=0;j<n-1;j++) for(i=0;i<=n-1-j;i++) if (q[i] > q[i + 1]) { t = q[i]; q[i] = q[i + 1]; q[i + 1] = t; } for (int i = 0, u=0; i <= n; i++, u++) { if (u!=0) printf(" "); printf("%d", q[i]); } printf("\n"); } return 0; }