#include<cstdio>

#include<cstring>

#include<algorithm>

#define ll long long

using namespace std;

int rdn()

{

  int ret=;bool fx=;char ch=getchar();

  while(ch>''||ch<''){if(ch=='-')fx=;ch=getchar();}

  while(ch>=''&&ch<='')ret=ret*+ch-'',ch=getchar();

  return fx?ret:-ret;

}

const int N=1e5+,mod=;

int upt(int x){while(x>=mod)x-=mod;while(x<)x+=mod;return x;}

int pw(int x,int k)

{int ret=;while(k){if(k&)ret=(ll)ret*x%mod;x=(ll)x*x%mod;k>>=;}return ret;}

int n,k,a[N],b[N],jc[N],jcn[N];

bool cmp(int a,int b){return a>b;}

void init()

{

  jc[]=;for(int i=;i<=n;i++)jc[i]=(ll)jc[i-]*i%mod;

  jcn[n]=pw(jc[n],mod-);

  for(int i=n-;i>=;i--)jcn[i]=(ll)jcn[i+]*(i+)%mod;

}

int C(int n,int m)

{

  if(n<m)return ;

  return (ll)jc[n]*jcn[m]%mod*jcn[n-m]%mod;

}

int cal(int x)//a<x&&2*a>=x

{

  int l=,r=n,L=n+;

  while(l<=r)

    {

      int mid=l+r>>;

      if(b[mid]>=x)l=mid+;

      else if(*b[mid]<x)r=mid-;

      else L=mid,r=mid-;

    }

  l=; r=n; int R=;

  while(l<=r)

    {

      int mid=l+r>>;

      if(b[mid]>=x)l=mid+;

      else if(*b[mid]<x)r=mid-;

      else R=mid,l=mid+;

    }

  if(L<=R) return R-L+; return ;

}

int cal2(int x)//a>=x&&a<2*x

{

  int l=,r=n,x2=*x,L=n+;

  while(l<=r)

    {

      int mid=l+r>>;

      if(b[mid]<x)r=mid-;

      else if(b[mid]>=x2)l=mid+;

      else L=mid,r=mid-;

    }

  l=; r=n; int R=;

  while(l<=r)

    {

      int mid=l+r>>;

      if(b[mid]<x)r=mid-;

      else if(b[mid]>=x2)l=mid+;

      else R=mid,l=mid+;

    }

  if(x<x2)R--;//self

  if(L<=R) return R-L+; return ;

}

int main()

{

  n=rdn();k=rdn();

  for(int i=;i<=n;i++)

    a[i]=b[i]=rdn();

  sort(b+,b+n+,cmp); init();

  for(int i=;i<=n;i++)

    {

      int ct=cal(a[i]),ans=;

      ans=C(n-ct-,k);

      ct=cal2(a[i]);

      if(ct<k)ans=upt(ans+C(n-ct-,k-ct-));

      printf("%d\n",ans);

    }

  return ;

}