#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e18 + 1e17;
const long long mod = 1e9 + 7;
long long modInverse(long long a, long long m) {
  long long m0 = m;
  long long y = 0, x = 1;
  if (m == 1) return 0;
  while (a > 1) {
    long long q = a / m;
    long long t = m;
    m = a % m, a = t;
    t = y;
    y = x - q * y;
    x = t;
  }
  if (x < 0) x += m0;
  return x;
}
long long powm(long long a, long long b) {
  a = a % mod;
  long long res = 1;
  while (b) {
    if (b & 1) res = (res * a) % mod;
    a = (a * a) % mod;
    b >>= 1;
  }
  return (res % mod);
}
const long long N = 1e5 + 5;
void solve() {
  double a, b, m;
  cin >> a >> b >> m;
  double vx, vy, vz;
  cin >> vx >> vy >> vz;
  vy = abs(vy);
  double tim = m / vy;
  double dist_x = abs(vx) * tim;
  double dist_z = vz * tim;
  long long y = dist_z / b;
  dist_z = dist_z - y * b;
  if (y % 2) dist_z = b - dist_z;
  if (vx > 0)
    dist_x = dist_x + a / 2;
  else
    dist_x = dist_x + 3 * a / 2;
  y = dist_x / a;
  dist_x = dist_x - y * a;
  if (y % 2) dist_x = a - dist_x;
  cout << dist_x << ' ' << dist_z << '\n';
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cout << setprecision(10) << fixed;
  long long t = 1;
  for (long long i = 1; i <= t; i++) {
    solve();
  }
}
