# include <bits/stdc++.h>
# define ll long long

using namespace std;

const int N = 2e5 + 5;
struct Dis {
ll x, y;
} P, Q;
struct Len {
Dis x, y;
Len (Dis X = {0, 0}, Dis Y = {0, 0}) {
  x = X; y = Y;
}
} s[N];
int n;

Dis operator -(Dis x, Dis y) {
  return {x.x - y.x, x.y - y.y};
}
ll operator *(Dis x, Dis y) {
  return x.x * y.y - x.y * y.x;
}
ll operator *(Len x, Len y) {
  return (x.y - x.x) * (y.y - y.x);
}
bool operator !=(Dis x, Dis y) {
  return x.x != y.x || x.y != y.y;
}

vector<Dis> v[4];
int bit[N];

void add(int x, int v) {
  for (; x <= n; x += x & -x) {
    bit[x] += v;
  }
}

int sum(int x) {
  int v = 0;
  for (; x; x -= x & -x) {
    v += bit[x];
  }
  return v;
}

int f[N], r[N];
Dis c[N];
ll clc(vector<Dis> &x, vector<Dis> &y, Dis p, Dis q) {
  int m = x.size() + y.size();
  ll res = 0;
  memset(bit, 0, sizeof(int) * (m + 1));
  for (int i = 0; i < x.size(); i++) {
    c[i] = x[i];
    // cerr << x[i].x << ' ' << x[i].y << '\n';
  }
  // cerr << '\n';
  for (int i = 0; i < y.size(); i++) {
    c[i + x.size()] = y[i];
    // cerr << y[i].x << ' ' << y[i].y << '\n';
  }
  // cerr << '\n';
  // cerr << '\n';
  for (int i = 0; i < m; i++) {
    f[i] = i;
  }
  sort(f, f + m, [](int x, int y){
    ll v = Len(P, c[x]) * Len(P, c[y]);
    if (v == 0) {
      return x < y;
    }
    return v > 0;
  });
  for (int i = 0; i < m; i++) {
    r[f[i]] = i + 1;
  }
  sort(f, f + m, [](int x, int y){
    ll v = Len(Q, c[x]) * Len(Q, c[y]);
    if (v == 0) {
      return x < y;
    }
    return v > 0;
  });
  for (int i = 0; i < m; i++) {
    if (f[i] < x.size()) {
      add(r[f[i]], 1);
    } else {
      res += sum(r[f[i]]);
    }
  }
  // cerr << res << '\n';
  return res;
}

void sov() {
  cin >> P.x >> P.y >> Q.x >> Q.y;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> s[i].x.x >> s[i].x.y >> s[i].y.x >> s[i].y.y;
    if (s[i].x != P && s[i].y != P && s[i].x != Q && s[i].y != Q && s[i] * Len(P, Q)) {
      bool d = Len(P, Q) * Len(P, s[i].x) < 0;
      if (s[i] * Len(P, s[i].x) == 0 && (Len(P, s[i].x) * Len(P, Q)) * (Len(P, s[i].y) * Len(P, Q)) < 0) {
        v[d].push_back(s[i].x);
        v[!d].push_back(s[i].y);
      } else if (s[i] * Len(Q, s[i].x) == 0 && (Len(Q, s[i].x) * Len(Q, P)) * (Len(Q, s[i].y) * Len(Q, P)) < 0) {
        v[d | 2].push_back(s[i].x);
        v[!d | 2].push_back(s[i].y);
      }
    }
  }
  ll ans = v[0].size() * v[2].size();
  ans -= clc(v[0], v[2], P, Q) + clc(v[3], v[1], Q, P);
  cout << ans << '\n';
}

int main() {
# ifndef ONLINE_JUDGE
  freopen("in.txt", "r", stdin);
  freopen("out.txt", "w", stdout);
# endif
  ios::sync_with_stdio(0);
  cin.tie(0); cout.tie(0);
  int T = 1;
  cin >> T;
  while (T--) {
    sov();
  }
}