#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int M=505;
int read(){
    int ans=0,f=1,c=getchar();
    while(c<‘0‘||c>‘9‘){if(c==‘-‘) f=-1; c=getchar();}
    while(c>=‘0‘&&c<=‘9‘){ans=ans*10+(c-‘0‘); c=getchar();}
    return ans*f;
}
int n,m,ans;
int w[M],sum[M],f[M+7];
void dfs(int deep){
    int mx;
    memset(f,0x3f,sizeof(f));
    f[0]=0;
    for(mx=1;mx<=M;mx++){
        for(int i=1;i<=deep&&w[i]<=mx;i++) f[mx]=min(f[mx],f[mx-w[i]]+1);
        if(f[mx]>n){
            mx--;
            if(mx>ans){
                ans=mx;
                for(int i=1;i<=deep;i++) sum[i]=w[i];
            }
            break;
        }
    }
    if(deep==m) return ;
    for(int i=mx+1;i>w[deep];i--){
        w[deep+1]=i;
        dfs(deep+1);
    }
}
int main()
{
    n=read(); m=read();
    w[1]=1;
    dfs(1);
    for(int i=1;i<=m;i++) printf("%d ",sum[i]); 
    printf("\n");
    printf("MAX=%d\n",ans);
    return 0;
}