#include <bits/stdc++.h>
using namespace std;
bool isprime(int n) {
  int i;
  for (i = 2; i * i <= n; ++i) {
    if (n % i == 0) return false;
  }
  return true;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long i, k, a, b, x, t, cot = 0, cou = 0;
  long long tt, n, m;
  cin >> n >> m;
  if (m - n <= 1) {
    cout << -1;
    return 0;
  }
  if (n % 2 == 0)
    cout << n << " " << n + 1 << " " << n + 2;
  else if (m - n > 2)
    cout << n + 1 << " " << n + 2 << " " << n + 3;
  else
    cout << -1;
}
