Go: // Package main provides
//
// File:  1237.go
// Author: ymiyamoto
//
// Created on Wed Jul 11 10:35:26 2018
//
package main

import (
	"fmt"
	"strconv"
	"strings"
)

func comb(ns []string, aux [][]string) [][]string {
	if len(ns) == 0 {
		return aux
	}
	v := ns[0]
	a := [][]string{}
	for _, au := range aux {
		tmp := make([]string, len(au))
		copy(tmp, au)
		tmp[len(tmp)-1] += v
		a = append(a, tmp)

		au = append(au, v)
		a = append(a, au)
	}

	return comb(ns[1:], a)
}

func main() {
	for {
		var d int
		var num string
		fmt.Scan(&d, &num)
		if d == 0 {
			break
		}

		var min int
		ns := strings.Split(num, "")
		for i := range ns {
			v, _ := strconv.Atoi(ns[i])
			min += v
		}

		var ans int
		var pat []string
		var hasSame bool
		for _, c := range comb(ns[1:], [][]string{{ns[0]}}) {
			var total int
			for _, v := range c {
				n, _ := strconv.Atoi(v)
				total += n
			}
			if ans == total {
				hasSame = true
			} else if ans < total && total <= d {
				ans = total
				pat = c
				hasSame = false
			}
		}

		if ans == 0 {
			fmt.Println("error")
		} else if hasSame {
			fmt.Println("rejected")
		} else {
			fmt.Println(ans, strings.Join(pat, " "))
		}
	}
}

C++: #include <stdio.h>
#include <cctype>
#include <limits.h>
#include <cmath>
#include <complex>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <cstring>
#include <string>
#include <sstream>
#include <algorithm>
#include <iomanip>
#include <iostream>

#define VARIABLE(x) cerr << #x << "=" << x << endl
#define BINARY(x) static_cast<bitset<16> >(x)
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define REP(i,m,n) for (int i=m;i<(int)(n);i++)
#define if_range(x, y, w, h) if (0<=(int)(x) && (int)(x)<(int)(w) && 0<=(int)(y) && (int)(y)<(int)(h))
#define ALL(a) (a).begin(),(a).end()
int dx[4]={0, -1, 1, 0}, dy[4]={-1, 0, 0, 1};
using namespace std;
typedef long long ll;
typedef vector<vector<int> > VVI;
const int INF = 1e9;
typedef pair<int, int> PII;

int S;
string N;

int ans=-1;
vector<int> ans_list;
bool ng;

void init()
{
    ans = -1;
    ans_list.resize(0);
    ng = false;
}

void solve(int sum, int k, vector<int> list)
{
    if (sum > S) return;
    if (N[k] == '0') {
       list.push_back(0);
       solve(sum, k+1, list);
       list.erase(list.end()-1);
       return;
    }

    if (k == N.size()) { 
        if (sum > ans) {
            ans = sum;
            ans_list = list;
            ng = false;
        } else if (sum == ans) {
            ng = true;
        }
        return;
    }
    
    int n = 0;
    for (int i=0; k+i<N.size(); i++) {
        n *= 10;
        n += N[k+i] - '0';
        
        list.push_back(n);
        solve(sum+n, k+i+1, list);
        list.erase(list.end()-1);
    }
}

int main()
{
    while (cin>>S>>N, S) {
        init();
        
        solve(0, 0, vector<int>());
        
        if (ans == -1) cout << "error" << endl;
        else if (ng) cout << "rejected" << endl;
        else {
            cout << ans << " ";
            for (int i=0; i<ans_list.size(); i++) {
                if (i>0) cout << " ";
                cout << ans_list[i];
            }
            cout << endl;
        }
    }
}

C++: #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <climits>
#include <cstring>
#include <cassert>


using namespace std;
#define SZ(x) (int)(x.size())
#define REP(i, n) for(int i=0;i<n;++i)
#define FOR(i, a, b) for(int i=a;i<b;++i)
#define RREP(i, n) for(int i=n-1;i>=0;--i)
#define RFOR(i, a, b) for(int i=b-1;i>=a;--i)

#define all(x) begin(x),end(x)
#define dump(x) cerr<<#x<<" = "<<(x)<<endl
#define debug(x) cerr<<#x<<" = "<<(x)<<" (L"<<__LINE__<<")"<< endl;

using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using P = pair<int, int>;
const double eps = 1e-8;
const ll MOD = 1000000007;
const int INF = INT_MAX / 2;
const ll LINF = LLONG_MAX / 2;

template<class T>
bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
bool chmin(T &a, const T &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}


template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> p) {
    os << p.first << ":" << p.second;
    return os;
}

template<class T>
ostream &operator<<(ostream &os, const vector<T> &v) {
    os << "[";
    REP(i, SZ(v)) {
        if (i) os << ", ";
        os << v[i];
    }
    return os << "]";
}

template<class T1, class T2>
ostream &operator<<(ostream &os, const map<T1, T2> &mp) {
    os << "[";
    for (auto it = mp.begin(); it != mp.end(); ++it) {
        if (it != mp.begin()) {
            os << ", ";
        }
        os << *it;
    }
    return os << "]";
}

// edit

bool solve() {
    int n, m;
    cin >> n >> m;
    if (n == 0 && m == 0) return false;

    string sm = to_string(m);

    if (sm.size() == 1) {
        if (n < m) {
            cout << "error" << endl;
            return true;
        } else {
            cout << m << " " << m << endl;
            return true;
        }
    }

    vector<vector<vector<int>>> vv(n + 1);

    int sz = sm.size();
    for (int mask = 0; mask < 1 << (sz - 1); ++mask) {
        vector<int> vec;
        int buf = 0;
        for (int i = 0; i < sz - 1; ++i) {
            buf *= 10;
            buf += sm[i] - '0';
            if (mask >> i & 1) {
                vec.push_back(buf);
                buf = 0;
            }
        }
        buf *= 10;
        buf += sm[sz - 1] - '0';
        vec.push_back(buf);

        int sum = accumulate(all(vec), 0);
        if (sum <= n) {
            vv[sum].push_back(vec);
        }
    }

//    for (int i = 0; i <= n; ++i) {
    for (int i = n; i >= 0; --i) {
        if (vv[i].size() == 0) continue;
        if (vv[i].size() >= 2) {
            cout << "rejected" << endl;
            return true;
        }
        if (vv[i].size() == 1) {
            cout << i << " ";
            for (int j = 0; j < vv[i][0].size(); ++j) {
                cout << vv[i][0][j];
                if (j + 1 == vv[i][0].size()) {
                    cout << endl;
                } else {
                    cout << ' ';
                }
            }
            return true;
        }
    }

    cout << "error" << endl;
    return true;
}


int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
//    std::ifstream in("input.txt");
//    std::cin.rdbuf(in.rdbuf());

    while (solve());


    return 0;
}