#include <bits/stdc++.h>
using namespace std;
void read(vector<long long>& c, long long size) {
  for (int i = 0; i < size; i++) {
    int q;
    scanf("%d", &q);
    c.push_back(q);
  }
}
void read(vector<pair<long long, long long> >& c, long long size) {
  for (int i = 0; i < size; i++) {
    int q;
    int r;
    scanf("%d", &q);
    scanf("%d", &r);
    c.push_back(make_pair(q, r));
  }
}
void print(vector<long long>& coeffs) {
  for (int i = 0; i < coeffs.size(); i++) {
    cout << coeffs[i] << " ";
  }
  cout << endl;
}
long long op(long long a, long long b, int& l) {
  if (l % 2 == 0) {
    l++;
    return a + b;
  }
  if (l % 2 == 1) {
    l++;
    return a - b;
  }
}
long long power(long long a, long long b, long long M) {
  if (b == 0) {
    return 1;
  } else {
    long long q = power(a, b / 2, M);
    long long r = (q * q) % M;
    if (b % 2) {
      return (r * a) % M;
    } else {
      return r;
    }
  }
}
long long inv(long long a, long long M) { return power(a, M - 2, M); }
bool input() {
  string q;
  cin >> q;
  return (q == "TAK");
}
int print(long long q, long long l, long long r) {
  cout << q << " " << l << " " << r << endl;
  fflush(stdout);
  if (q == 1) {
    return input();
  }
  return -1;
}
long long bs(long long l, long long r) {
  while (l < r) {
    long long mid = (l + r) / 2;
    int q = print(1, mid, mid + 1);
    if (q == 1) {
      r = mid;
    } else {
      l = mid + 1;
    }
  }
  return l;
}
long long gcd(long long a, long long b) {
  if (a < b) {
    return gcd(b, a);
  }
  if (b == 0) {
    return a;
  }
  return gcd(b, a % b);
}
long long M = 300007;
vector<vector<long long> > mul(vector<vector<long long> >& a,
                               vector<vector<long long> >& b, long long c) {
  vector<vector<long long> > w(c + 1, vector<long long>(c + 1, 0));
  long long i, j, k;
  for (i = 0; i <= c; i++) {
    for (j = 0; j <= c; j++) {
      for (k = 0; k <= c; k++) {
        long long p = (a[i][k] * b[k][j]) % 1000000007;
        w[i][j] = (w[i][j] + p) % 1000000007;
      }
    }
  }
  return w;
}
void mul2(vector<vector<long long> >& a, long long* p, long long c) {
  long long w[16];
  long long i, j;
  for (i = 0; i <= c; i++) {
    w[i] = 0;
    for (j = 0; j <= c; j++) {
      long long e = (a[i][j] * p[j]) % 1000000007;
      w[i] = (w[i] + e) % 1000000007;
    }
  }
  for (i = 0; i <= c; i++) {
    p[i] = w[i];
  }
}
vector<vector<long long> > power(vector<vector<long long> >& q, long long n,
                                 long long c) {
  if (n == 1) {
    auto c = q;
    return c;
  }
  auto w = power(q, n / 2, c);
  auto w1 = mul(w, w, c);
  if (n % 2) {
    return mul(w1, q, c);
  } else {
    return w1;
  }
}
int main() {
  long long m, n, k, d;
  long long f;
  long long l, r, q;
  long long i, j;
  long long c, v0, v1;
  long long a, b;
  cin >> n >> k;
  long long p = n / (2 * (k + 1));
  long long p1 = p * (k + 1);
  cout << p << " " << p * k << " " << n - (p * (k + 1)) << endl;
}
