#include<bits/stdc++.h>
using namespace std;
#define nl "\n"
#define fi first
#define se second
#define pb push_back
#define ll long long
#define ull unsigned ll
#define RV  return void
// #define inf 2000000000
#define sz(x) int(x.size())
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define Mini(x) *min_element(all(x))
#define Maxi(x) *max_element(all(x))
#define fixed(n) fixed << setprecision(n)
#define ceil(w, m) (((w) / (m)) + ((w) % (m) ? 1 : 0))
#define cin(v) for (auto&i:v) cin >> i;
#define cout(v) for (auto&i:v) cout << i << " ";
#define clr(memo, x) memset(memo, x, sizeof memo)
#define updmin(a, b) a = min(a, b)
#define updmax(a, b) a = max(a, b)
#define vi vector < int >
#define vl vector < ll >
#define vc vector < char >
#define vs vector < string >
#define v2i vector < vector < int > >
#define v2l vector < vector < int > >
#define seti set < int >
#define setl set < ll >
#define mapii map < int , int >
#define mapll map < ll , ll >
#define mapli map < ll , int >
#define mapci map < char , int >
#define mapsi map < string , int >
#define pll pair < ll , ll >
#define pii pair < int , int >
#define range(l,r,x) for(int i=l ; i < r ; i+=x)
#define FastCode ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
vector < string > ternary= {"NO\n" , "YES\n"};

void  Zainab(){
            #ifndef ONLINE_JUDGE
              freopen("input.txt", "r", stdin);
              freopen("output.txt", "w", stdout);
            #endif
}


/*================================  solution  ================================ */


//  max -> pow ( 9 , 18 )

multiset < ll > st ;



void rec(string & s , int idx , ll num , bool flag){

    if(idx == sz(s)){
        st.insert(num);
        return ;
    }


    for(int i =0 ; i <= 9 ; i++){
         if(!flag and (i+'0') > s[idx]) continue;
         rec(s , idx +1 , num * i , flag or (i+'0') < s[idx] );
    }

}

void rec2(string & s , int idx , ll num , bool flag){

    if(idx == sz(s)){
        auto it = st.find(num) ;
        if(it!=st.end())
           st.erase( it);
        return ;
    }

    for(int i =0 ; i <= 9 ; i++){
         if(!flag and (i+'0') > s[idx]) continue;
         rec2(s , idx +1 , num * i , flag or (i+'0') < s[idx] );
    }

}


void myCode(){

    st.clear();
    string l , r;
    cin >> l >> r;
    rec(r , 0 , 1 , 0);


    //  miuns one from string l
    if(l.back() == '0'){
         l[sz(l) - 2]--;
         l.back()='9';
    }else l.back()--;

    if(l=="0") l ="";


    // cout << l << nl;

    for(auto& i : st) cout << i << " ";

    rec2(l , 0 , 1 , 0);
    cout << nl << nl ;
     for(auto& i : st) cout << i << " ";
    // cout << *st.rbegin();

}


int main(){
                                   FastCode ;
                                     Zainab() ;

        int testCase=1;
            // cin >> testCase ;
        for(int i=1 ; i<= testCase ; i++){
            myCode();
        }


    return 0;
}