CounterExample

#include<bits/stdc++.h>
using namespace std;

#define sc( x ) scanf( "%d" , &x )
#define REP( i , n ) for( int i = 0 ; i < n ; ++i )
#define clr( t , val ) memset( t , val , sizeof( t ) )

#define pb push_back
#define all( v ) v.begin() , v.end()
#define SZ( v ) ((int)(v).size())

#define mp make_pair
#define fi first
#define se second

typedef long long ll;

int main(){
    ll L , R;
    while( cin >> L >> R ){
        bool found = 0;
        for( ll a = L ; !found && a < R ; ++a )
            for( ll b = a + 1 ; !found && b < R ; ++b )
                for( ll c = b + 1 ; !found && c <= R ; ++ c ){
                    if( __gcd( a , b ) == 1 && __gcd( b , c ) == 1 && __gcd( a , c ) != 1 ) {
                        cout << a << ' ' << b << ' ' << c << '\n';
                        found = 1;
                        break;
                    }
                }
        if( !found ) cout << "-1" << '\n';
    }
}