#include<fstream>
using namespace std;
ifstream cin("loto.in");
ofstream cout("loto.out");
int n, s , S,x, a[1000001], b[1000001], i, u, d;
void quickSort(int arr[], int left, int right) 
{
      int i = left, j = right;
      int tmp;
      int pivot = arr[(left + right) / 2];
 
      /* partition */
      while (i <= j) 
      {
            while (arr[i] < pivot)
                  i++;
            while (arr[j] > pivot)
                  j--;
            if (i <= j) 
                     {
                  tmp = arr[i];
                  arr[i] = arr[j];
                  arr[j] = tmp;
                  i++;
                  j--;
                  }
      }
      if (left < j)
            quickSort(arr, left, j);
      if (i < right)
            quickSort(arr, i, right);
}
int main()
{
    cin>>n>>S;
    for(i=1;i<=n;i++)
       cin>>a[i];
    quickSort(a, 1, n);
    s=S;
    while(s>a[n])
    {
    u++;
    b[u]=a[n];
    s=s-a[n];
    d=d+a[n];
    }
    u++;
    
    b[u]=S-d;
    for(i=1;i<=u;i++)
       cout<<b[i]<<" ";
    return 0;
}