#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return (a == 0) ? b : gcd(b % a, a); }
int main() {
  long long a, b;
  cin >> a >> b;
  for (long long i = a; i <= b - 2; i++)
    for (long long j = a + 2; j <= b; j++)
      for (long long k = i + 1; k <= j - 1; k++)
        if (gcd(i, k) == 1 && gcd(k, j) == 1 && gcd(i, j) != 1) {
          cout << i << " " << k << " " << j << endl;
          return 0;
        }
  cout << "-1" << endl;
  return 0;
}
