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