#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int INF = 1e9 + 8;
const double pi = 3.14159265359;
template <class T>
T fac(T n) {
  T res = 1, i;
  for (i = 2; i <= n; i++) res *= i;
  return res;
}
template <class T>
T lcm(T a, T b) {
  return (a * b) / __gcd(a, b);
}
template <class T>
T digitsum(T x) {
  T sum = 0;
  while (x) {
    sum += x % 10;
    x /= 10;
  }
  return sum;
}
string tostring(int a) {
  string ans;
  while (a) {
    ans += char(a % 10 + '0');
    a /= 10;
  }
  return ans;
}
void nPermute(string str, long int n) {
  sort((str).begin(), (str).end());
  long int i = 1;
  do {
    if (i == n) break;
    i++;
  } while (next_permutation(str.begin(), str.end()));
  cout << str << endl;
}
vector<int> factors(int n) {
  vector<int> f;
  for (int x = 2; x * x <= n; x++) {
    while (n % x == 0) {
      f.push_back(x);
      n /= x;
    }
  }
  if (n > 1) f.push_back(n);
  return f;
}
bool prime(int n) {
  if (n < 2) return false;
  for (int x = 2; x * x <= n; x++)
    if (n % x == 0) return false;
  return true;
}
tuple<int, int, int> Gcd(int a, int b) {
  if (b == 0)
    return {1, 0, a};
  else {
    int x, y, g;
    tie(x, y, g) = Gcd(b, a % b);
    return {y, x - (a / b) * y, g};
  }
}
template <class T>
T modpow(T x, T n, T m) {
  if (n == 0) return 1 % m;
  T u = modpow(x, n / 2, m);
  u = (u * u) % m;
  if (n % 2 == 1) u = (u * x) % m;
  return u;
}
void solve() {
  int a, b, c, d, k;
  cin >> a >> b >> c >> d >> k;
  if (a % c != 0 && b % d != 0) {
    if ((a / c + 1) + (b / d + 1) <= k)
      cout << (a / c + 1) << " " << (b / d + 1) << endl;
    else
      cout << -1 << endl;
  } else if (a % c == 0 && b % d != 0) {
    if (a / c + (b / d + 1) <= k)
      cout << a / c << " " << b / d + 1 << endl;
    else
      cout << -1 << endl;
  } else if (a % c != 0 && b % d == 0) {
    if ((a / c + 1) + (b / d) <= k)
      cout << (a / c + 1) << " " << (b / d) << endl;
    else
      cout << -1 << endl;
  } else {
    if ((a / c) + (b / d) <= k)
      cout << (a / c) << " " << (b / d) << endl;
    else
      cout << -1 << endl;
  }
}
int main() {
  int t;
  cin >> t;
  while (t--) solve();
}
