题目链接：http://codeforces.com/contest/1088/problem/B
#include<bits/stdc++.h>
using namespace std;#define debug puts("YES");
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define ll __int64#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define root l,r,rt
#define mst(a,b) memset((a),(b),sizeof(a))#define pii pair<ll,ll>
#define mk(x,y) make_pair(x,y)const int maxn =1e5+5;
const int maxm=250005;
const int mod=1e9+7;
const int ub=1e6;
ll powmod(ll x,ll y){ll t; for(t=1;y;y>>=1,x=x*x%mod) if(y&1) t=t*x%mod; return t;}
ll gcd(ll x,ll y){return y?gcd(y,x%y):x;}int n,k,x,pre=0;
set<int> st;
set<int>::iterator it;
int main()
{cin>>n>>k;rep(i,1,n+1) {cin>>x;st.insert(x);}for(it=st.begin();it!=st.end();it++){if(k) {k--;cout<<(*it)-pre<<endl;}else break;pre=*it;}if(k) while(k--) puts("0");return 0;
}