#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
inline ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
inline ll lcm(ll a, ll b) { return a / gcd(a, b)*b; }
template<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << "(" << o.first << "," << o.second << ")"; return out; }
template<class T> ostream& operator << (ostream& out,const vector<T>& V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << " ";} return out; }
template<class T> ostream& operator << (ostream& out,const vector<vector<T> >& Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; }
template<class S,class T> ostream& operator << (ostream& out,const map<S,T>& mp){ out << "{ "; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << ":" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << ", "; } out << " }"; return out; }
template<typename T>vector<T> make_v(size_t a){return vector<T>(a);}
template<typename T,typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));}
template<typename T,typename V> typename enable_if<is_class<T>::value==0>::type fill_v(T &t,const V &v){t=v;}
template<typename T,typename V> typename enable_if<is_class<T>::value!=0>::type fill_v(T &t,const V &v){for(auto &e:t) fill_v(e,v);}
/*
 <url:>
 問題文============================================================
 =================================================================
 解説=============================================================
 ================================================================
 */





template<class Type>
Type solve(Type res = Type()){
    ll t;
    string num;
    while(cin >> t >> num,t){
        map<ll,int> mp;
        
        function<void(int,int,int)> rec1 = [&](int n,int tsum,int sum){
            if(tsum + sum > t) return;
            if(n == num.length()){
                sum += tsum;
                mp[sum]++;
                return;
            }
            rec1(n+1,tsum*10 + (num[n]-'0'),sum);
            rec1(n+1,(num[n]-'0'),sum+tsum);
        };
        rec1(1,num[0]-'0',0);
        
        if(mp.empty()){
            cout << "error" << endl;
            continue;
        }
        if(mp.rbegin()->second >= 2){
            cout << "rejected" << endl;
            continue;
        }
        
        
        vector<int> ans;
        function<bool(int,int,int)> rec2 = [&](int n,int tsum,int sum){
            if(tsum + sum > t) return false;
            if(n == num.length()){
                if(sum+tsum == mp.rbegin()->first){
                    ans.push_back(tsum);
                    return true;
                }
                return false;
            }
            if(rec2(n+1,tsum*10 + (num[n]-'0'),sum)){
                return true;
            }
            if(rec2(n+1,(num[n]-'0'),sum+tsum)){
                ans.push_back(tsum);
                return true;
            }
            return false;
        };
        rec2(1,num[0]-'0',0);
        
        ans.push_back(mp.rbegin()->first);
        reverse(ans.begin(), ans.end());
        cout << ans << endl;
    }
    return res;
}


int main(void) {
    cin.tie(0); ios_base::sync_with_stdio(false);
    solve(0);
    // cout << fixed << setprecision(15) << solve<string>() << endl;
    return 0;
}



Measured memory_bytes: 3088