#include <bits/stdc++.h>
using namespace std;
long long n, k;
long long bs(long long l, long long r) {
  if (l > r) return 0;
  long long mid = (l + r) / 2;
  if (double(2 * (1 + k)) <= double(n) / double(mid))
    return max(mid, bs(mid + 1, r));
  return bs(l, mid - 1);
}
int main() {
  cin >> n >> k;
  long long ans = bs(0, n / 2ll);
  cout << ans << " " << ans * k << " " << n - ans - ans * k << endl;
  return 0;
}
