#include<bits/stdc++.h>
using namespace std;
int n , k;
vector<vector<int>> v;
int X[1000001];
void khoitao(){
cin >> n >> k;
}
void Try(int i , int bd , int sum){
for(int j = bd ; j <= 9 ; j++){
X[i] = j ;
if(i == k && sum + j == n){
vector<int> tmp(X+1,X+k+1);
v.push_back(tmp);
}
else if(i < k && sum + j <= n){ // Fixing the condition
Try(i+1,j+1,sum+j);
}
}
}
int main(){
khoitao();
Try(1,1,0);
if(v.empty()){
cout << "NOT FOUND";
return 0 ;
}
sort(v.begin(),v.end());
for(vector<int> p : v){
for(int i = 0 ; i < p.size() ;i++){
if(i < p.size() - 1){
cout << p[i] << " + ";
}
else cout << p[i] << endl;
}
}
}
I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKaW50IG4gLCBrOyAKdmVjdG9yPHZlY3RvcjxpbnQ+PiB2OyAKaW50IFhbMTAwMDAwMV07CnZvaWQga2hvaXRhbygpewogICAgY2luID4+IG4gPj4gazsKfQp2b2lkIFRyeShpbnQgaSAsIGludCBiZCAsIGludCBzdW0pewogICAgZm9yKGludCBqID0gIGJkIDsgaiA8PSA5IDsgaisrKXsKICAgICAgICBYW2ldID0gaiA7CiAgICAgICAgaWYoaSA9PSBrICYmIHN1bSArIGogPT0gbil7CiAgICAgICAgICAgIHZlY3RvcjxpbnQ+IHRtcChYKzEsWCtrKzEpOwogICAgICAgICAgICB2LnB1c2hfYmFjayh0bXApOwogICAgICAgIH0KICAgICAgICBlbHNlIGlmKGkgPCBrICYmIHN1bSArIGogPD0gbil7IC8vIEZpeGluZyB0aGUgY29uZGl0aW9uCiAgICAgICAgICAgIFRyeShpKzEsaisxLHN1bStqKTsKICAgICAgICB9CiAgICB9Cn0KaW50IG1haW4oKXsgCiAgICBraG9pdGFvKCk7CiAgICBUcnkoMSwxLDApOwogICAgaWYodi5lbXB0eSgpKXsKICAgICAgICBjb3V0IDw8ICJOT1QgRk9VTkQiOwogICAgICAgIHJldHVybiAwIDsKICAgIH0KICAgIHNvcnQodi5iZWdpbigpLHYuZW5kKCkpOwogICAgZm9yKHZlY3RvcjxpbnQ+IHAgOiB2KXsKICAgICAgICBmb3IoaW50IGkgPSAwIDsgaSA8IHAuc2l6ZSgpIDtpKyspewogICAgICAgICAgICBpZihpIDwgcC5zaXplKCkgLSAxKXsKICAgICAgICAgICAgICAgIGNvdXQgPDwgcFtpXSA8PCAiICsgIjsKICAgICAgICAgICAgfQogICAgICAgICAgICBlbHNlIGNvdXQgPDwgcFtpXSA8PCBlbmRsOwogICAgICAgIH0KICAgIH0KfQo=