#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
int cp(long long a, long long b) {
  if (gcd(a, b) == 1) return 1;
  return 0;
}
int main() {
  long long l, r, t, i, j, a, b, c, n, m, k;
  cin >> l >> r;
  n = 0;
  for (i = l; i <= r; ++i) {
    for (j = i + 1; j <= r; ++j) {
      for (k = j + 1; k <= r; ++k) {
        if (cp(i, k) == 0 && cp(i, j) == 1 && cp(j, k) == 1) {
          n = 1;
          break;
        }
      }
      if (n == 1) break;
    }
    if (n == 1) break;
  }
  if (n == 1)
    cout << i << ' ' << j << ' ' << k;
  else
    cout << "-1";
  return 0;
}
