#include <bits/stdc++.h>
using namespace std;
long long GCD(long long p, long long q) {
  if (p == 0) {
    return q;
  }
  return GCD(q % p, p);
}
int main(int argc, char const *argv[]) {
  long long int l, r;
  cin >> l >> r;
  if (abs(r - l) <= 1) {
    printf("-1\n");
    return 0;
  }
  for (long long int i = l; i <= r - 2; ++i) {
    for (long long int j = i + 1; j <= r - 1; ++j) {
      for (long long int k = j + 1; k <= r; ++k) {
        if (GCD(i, j) == 1 && GCD(j, k) == 1 && GCD(i, k) != 1) {
          cout << i << " " << j << " " << k << endl;
          return 0;
        }
      }
    }
  }
  cout << "-1" << endl;
  return 0;
}
