OI XVII - owc (Msea)

// https://szkopul.edu.pl/problemset/problem/ZJVIyol5_xl_W3I8dFikC_5F/site/?key=statement

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int read() {
    int X = 0, w = 1;
    char c = getchar();
    while (c < '0' || c > '9') {
        if (c == '-') w = -1;
        c = getchar();
    }
    while (c >= '0' && c <= '9')
        X = X * 10 + c - '0', c = getchar();
    return X * w;
}

const int N = 600 + 10, M = 20000 + 10;

int n, m, mod;
int f[N][N], dp[N][N];

struct Point {
    int x, y;
} a[N], b[M], O;
Point operator-(Point a, Point b) {
    return (Point){a.x - b.x, a.y - b.y};
}
int cross(Point a, Point b) {
    return a.x * b.y - a.y * b.x;
}

int main() {
    n = read(), m = read(), mod = read();
    for (int i = 1; i <= n; ++i)
        a[i] = (Point){read(), read()};
    for (int i = 1; i <= m; ++i)
        b[i] = (Point){read(), read()};
    for (int i = 1; i <= n; ++i) {
        O = a[i];
        sort(b + 1, b + m + 1, [](Point x, Point y) { return cross(x - O, y - O) < 0; });
        for (int j = i + 1, p = 0; j <= n; ++j) {
            while (p < m && cross(a[j] - a[i], b[p + 1] - a[i]) > 0)
                ++p;
            f[i][j] = !((p & 1) || (p < m && cross(a[j] - a[i], b[p + 1] - a[i]) == 0));
        }
    }
    for (int i = 1; i < n; ++i)
        dp[i][i + 1] = 1;
    for (int l = 3; l <= n; ++l)
        for (int i = 1; i + l - 1 <= n; ++i) {
            int j = i + l - 1;
            for (int k = i + 1; k < j; ++k)
                if (f[i][k] && f[k][j]) dp[i][j] = (dp[i][j] + 1ll * dp[i][k] * dp[k][j]) % mod;
        }
    printf("%d\n", dp[1][n]);
    return 0;
}