#include "bits/stdc++.h"

#define REP(i,n) for(ll i=0;i<n;++i)
#define RREP(i,n) for(ll i=n-1;i>=0;--i)
#define FOR(i,m,n) for(ll i=m;i<n;++i)
#define RFOR(i,m,n) for(ll i=n-1;i>=m;--i)
#define ALL(v) (v).begin(),(v).end()
#define PB(a) push_back(a)
#define UNIQUE(v) v.erase(unique(ALL(v)),v.end());
#define DUMP(v) REP(i, (v).size()) { cout << v[i]; if (i != v.size() - 1)cout << " "; else cout << endl; }
#define INF 1000000001ll
#define MOD 1000000007ll
#define EPS 1e-9

const int dx[8] = { 1,1,0,-1,-1,-1,0,1 };
const int dy[8] = { 0,1,1,1,0,-1,-1,-1 };


using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
ll max(ll a, int b) { return max(a, ll(b)); }
ll max(int a, ll b) { return max(ll(a), b); }
ll min(ll a, int b) { return min(a, ll(b)); }
ll min(int a, ll b) { return min(ll(a), b); }
///(?´????????`)(?´????????`)(?´????????`)(?´????????`)(?´????????`)(?´????????`)///
int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	while (1) {
		int t;
		string s;
		cin >> t >> s;
		if (!t)break;
		int n = s.size(), cnt = 0, cmax = -1;
		vi ans;
		REP(i, (1 << n - 1)) {
			int sum = 0;
			int tmp = 0;
			vi x;
			REP(j, n) {
				tmp *= 10;
				tmp += s[j] - '0';
				if (i & 1 << j) {
					sum += tmp;
					x.push_back(tmp);
					tmp = 0;

				}
			}
			sum += tmp;
			x.push_back(tmp);
			if (sum <= t) {
				if (sum == cmax)cnt++;
				else if (sum > cmax) {
					cnt = 1;
					cmax = sum;
					ans = x;
				}
			}
		}
		if (cmax == -1)cout << "error" << endl;
		else if (cnt > 1)cout << "rejected" << endl;
		else {
			cout << cmax << " ";
			DUMP(ans);
		}
	}
	return 0;
}