#include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int a, long long int b) {
  return (b == 0 ? a : gcd(b, a % b));
}
int lcm(int a, int b) { return (a * (b / gcd(a, b))); }
int main() {
  long long int l, r;
  scanf("%lld", &l);
  scanf("%lld", &r);
  long long int i = l;
  bool ans = false;
  while (i <= r) {
    long long int j = i + 1;
    while (j <= r) {
      long long int k = j + 1;
      while (k <= r) {
        if (gcd(i, j) == 1 && gcd(j, k) == 1 && gcd(i, k) > 1) {
          printf("%lld %lld %lld\n", i, j, k);
          return 0;
        }
        k++;
      }
      j++;
    }
    i++;
  }
  printf("-1\n");
  return 0;
}
