#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <bitset>
#include <ctime>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cassert>
#include <cstddef>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <sstream>
#include <fstream>

using namespace std;
#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, a) for(int (i) = (a) - 1; (i) >= 0; (i)--)
#define FORR(i, a, b) for(int (i) = (a) - 1; (i) >= (b); (i)--)
#define DEBUG(C) cerr << #C << " = " << C << endl;
using LL = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<LL>;
using VVL = vector<VL>;
using VD = vector<double>;
using VVD = vector<VD>;
using PII = pair<int, int>;
using PDD = pair<double, double>;
using PLL = pair<LL, LL>;
using VPII = vector<PII>;
template<typename T> using VT = vector<T>;
#define ALL(a) begin((a)), end((a))
#define RALL(a) rbegin((a)), rend((a))
#define SORT(a) sort(ALL((a)))
#define RSORT(a) sort(RALL((a)))
#define REVERSE(a) reverse(ALL((a)))
#define MP make_pair
#define FORE(a, b) for (auto &&a : (b))
#define FIND(s, e) ((s).find(e) != (s).end())
#define EB emplace_back
template<typename T>inline bool chmax(T &a,T b){if(a<b){a=b;return true;}return false;}
template<typename T>inline bool chmin(T &a,T b){if(a>b){a=b;return true;}return false;}

const int INF = 1e9;
const int MOD = INF + 7;
const LL LLINF = 1e18;

void init();
void last();

void init() {

}

int sum(string n) {
    int res = 0;
    for (char c : n) res += (c - '0');
    return res;
}
int sum(const vector<int> &v) {
    int res = 0;
    for (int e : v) res += e;
    return res;
}

int anssum = 0;
vector<int> ans;
bool rejected = false;
void dfs(const int &n, const string &m, int idx, vector<int> nowvec) {
    if (idx == m.length()) {
        const int vsum = sum(nowvec);
        if (vsum <= n && abs(vsum - n) < abs(n - anssum)) {
            anssum = vsum;
            ans = nowvec;
            return;
        }
    }
    for (int i = idx + 1; i <= m.length(); i++) {
        int buf = 0;
        for (int j = idx; j < i; j++) {
            buf = buf * 10 + m[j] - '0';
        }
        nowvec.emplace_back(buf);
        dfs(n, m, i, nowvec);
        nowvec.pop_back();
    }
    return;
}
void dfs2(const int &n, const string &m, int idx, vector<int> nowvec) {
    if (idx == m.length()) {
        const int vsum = sum(nowvec);
        rejected |= ((vsum == anssum) && (ans != nowvec));
    }
    for (int i = idx + 1; i <= m.length(); i++) {
        int buf = 0;
        for (int j = idx; j < i; j++) {
            buf = buf * 10 + m[j] - '0';
        }
        nowvec.emplace_back(buf);
        dfs2(n, m, i, nowvec);
        nowvec.pop_back();
    }
    return;
}

void solve(int n, string m) {
    if (n < sum(m)) {
        puts("error");
        return;
    }
    if (stoi(m) == n) {
        printf("%d %d\n", n, n);
        return;
    }
    dfs(n, m, 0, vector<int>());
    dfs2(n, m, 0, vector<int>());
    if (rejected) {
        puts("rejected");
        return;
    }
    printf("%d ", accumulate(begin(ans), end(ans), 0));
    for (int i = 0; i < ans.size(); i++) {
        printf("%d%c", ans[i], (i + 1 == ans.size() ? '\n' : ' '));
    }

}

void refresh() {
    rejected = false;
    anssum = 0;
    ans.clear();
}

void last() {
    exit(0);
}

int main(void) {
	int a, b, c, x, y, z, n, m, p, k;
	string s;
	while (cin >> n >> s, n) {
		solve(n, s);
        refresh();
	}
    last();
}

Measured memory_bytes: 3348