#include <bits/stdc++.h>
using namespace std;
const int maxn = 10000 + 5;
const long long maxm = 1e7;
const int mod = 1e9 + 7;
const int INF = 1 << 30;
const double eps = 1e-9;
const long long Max = 1e19;
void solve() {
  long long n, k;
  scanf("%lld%lld", &n, &k);
  long long can = n / 2;
  long long a = can / (k + 1);
  long long b = a * k;
  long long c = n - a - b;
  cout << a << " " << b << " " << c << endl;
}
int main() {
  int t = 1;
  while (t--) solve();
}
