#include<cstdio>

#include<cstring>

#include<algorithm>

using namespace std;

const int M=;

int read(){

    int ans=,f=,c=getchar();

    while(c<''||c>''){if(c=='-') f=-; c=getchar();}

    while(c>=''&&c<=''){ans=ans*+(c-''); c=getchar();}

    return ans*f;

}

int n,m,ans;

int w[M],sum[M],f[M+];

void dfs(int deep){

    int mx;

    memset(f,0x3f,sizeof(f));

    f[]=;

    for(mx=;mx<=M;mx++){

        for(int i=;i<=deep&&w[i]<=mx;i++) f[mx]=min(f[mx],f[mx-w[i]]+);

        if(f[mx]>n){

            mx--;

            if(mx>ans){

                ans=mx;

                for(int i=;i<=deep;i++) sum[i]=w[i];

            }

            break;

        }

    }

    if(deep==m) return ;

    for(int i=mx+;i>w[deep];i--){

        w[deep+]=i;

        dfs(deep+);

    }

}

int main()

{

    n=read(); m=read();

    w[]=;

    dfs();

    for(int i=;i<=m;i++) printf("%d ",sum[i]);

    printf("\n");

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

    return ;

}