#include <bits/stdc++.h>
using namespace std;
inline long long int modadd(long long int n, long long int m,
                            long long int p = 1000000007) {
  return ((n + m) % p + p) % p;
}
inline long long int modsub(long long int n, long long int m,
                            long long int p = 1000000007) {
  return ((n - m + p) % p + p) % p;
}
inline long long int modpro(long long int n, long long int m,
                            long long int p = 1000000007) {
  return (((n % p) * (m % p)) % p + p) % p;
}
unsigned long long int powe(long long int first, long long int second) {
  unsigned long long int res = 1;
  while (second > 0) {
    if (second & 1) res = res * first;
    second = second >> 1;
    first = first * first;
  }
  return res;
}
long long int modpow(long long int first, long long int second,
                     long long int p = 1000000007) {
  long long int res = 1;
  while (second > 0) {
    if (second & 1) res = modpro(res, first, p);
    second = second >> 1;
    first = modpro(first, first, p);
  }
  return res;
}
inline long long int modInverse(long long int n, long long int p = 1000000007) {
  if (n == 1) return 1;
  return modpow(n, p - 2, p);
}
inline long long int moddiv(long long int n, long long int m,
                            long long int p = 1000000007) {
  return modpro(n, modInverse(m, p), p);
}
inline long long int modadd3(long long int first, long long int second,
                             long long int z, long long int p = 1000000007) {
  return modadd(modadd(first, second, p), z, p);
}
inline long long int modadd4(long long int first, long long int second,
                             long long int z, long long int w,
                             long long int p = 1000000007) {
  return modadd(modadd(first, second, p), modadd(z, w, p), p);
}
inline long long int modnCr(long long int fac[], int n, int r,
                            long long int p = 1000000007) {
  if (r == 0) return 1;
  return modpro(fac[n], modInverse(modpro(fac[r], fac[n - r], p), p), p);
}
template <typename T>
void printArr(T *arr, int s, int n) {
  for (int i = s; i <= n; i++) {
    cout << arr[i] << " ";
  }
  cout << endl;
}
int a[205], ans[205];
int n;
void f(vector<int> v) {
  int sum = 0;
  for (int first : v) sum += first;
  assert(sum == n);
  int r = n, l = 0;
  for (int i = (0); i < (((int)(v).size())); i++) {
    for (int j = l, k = r - v[i]; j < l + v[i] && k < r; j++, k++) {
      ans[k] = a[j];
    }
    r -= v[i];
    l += v[i];
  }
  swap(a, ans);
}
int main() {
  std::ios::sync_with_stdio(false);
  cin.tie(NULL);
  int erer = 1;
  cin >> erer;
  for (int erer2 = (1); erer2 < (erer + 1); erer2++) {
    int n;
    cin >> n;
    int f = 0;
    for (int i = (0); i < (n / 3 + 1); i++) {
      for (int j = (0); j < (n / 5 + 1); j++) {
        for (int k = (0); k < (n / 7 + 1); k++) {
          if (i * 3 + j * 5 + k * 7 == n) {
            cout << (i) << " " << (j) << " " << (k) << endl;
            f = 1;
            break;
          }
        }
        if (f) break;
      }
      if (f) break;
    }
    if (!f) cout << -1 << endl;
  }
  return 0;
}
