#include <bits/stdc++.h>
using namespace std;
const long double pi = acos(-1.0);
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
bool checkprime(long long n) {
  long long i = 2;
  while (i * i <= n) {
    if (n % i == 0) return 0;
    i++;
  }
  return 1;
}
long long fact(long long n) {
  if (n == 0) return 1;
  return n * fact(n - 1);
}
long long sod(long long n) {
  long long sum = 0;
  while (n) {
    sum += n % 10;
    n /= 10;
  }
  return sum;
}
vector<long long> v;
long long bs(long long low, long long high, long long val) {
  long long mid = (low + high) / 2;
  if (low == high) return high;
  if (v[mid] >= val)
    return bs(low, mid, val);
  else
    return bs(mid + 1, high, val);
}
void lucky(long long n, long long cur, long long ct4, long long ct7,
           long long val) {
  if (n == cur) {
    if (ct4 == ct7) {
      v.push_back(val);
    }
    return;
  }
  lucky(n, cur + 1, ct4 + 1, ct7, val * 10 + 4);
  lucky(n, cur + 1, ct4, ct7 + 1, val * 10 + 7);
}
long long bs(long long a[], long long low, long long high, long long val) {
  long long mid = (low + high) / 2;
  if (low > high) return -1;
  if (a[mid] > val)
    return bs(a, low, mid - 1, val);
  else if (a[mid] < val)
    return bs(a, mid + 1, high, val);
  else
    return mid;
}
void DJ() {
  long long a, b;
  cin >> a >> b;
  if (b - a < 2)
    cout << -1;
  else if (b - a == 2 && a % 2)
    cout << -1;
  else {
    a += a % 2;
    cout << a << " " << a + 1 << " " << a + 2;
  }
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long t = 1;
  while (t--) DJ();
  return 0;
}
