#include<bits/stdc++.h>

using namespace std;
typedef long long ll;

struct Point {
public:
    ll x, y;

    ll operator^(Point &a) {
        return x * a.y - y * a.x;
    }
};

struct argcmp {
    bool operator()(Point &a, Point &b) {
        auto quad = [](Point &a) {
            if (a.y < 0) return 1;
            if (a.y > 0) return 4;
            if (a.x < 0)return 5;
            if (a.x > 0)return 3;
        };
        int qa = quad(a), qb = quad(b);
        if (qa != qb)return qa < qb;
        ll t = a ^ b;
        return t > 0;
    }
};

const int N = 6e5 + 5;

struct E {
    int u, v;
    Point a;
} e[N];
int fa[N];
int siz[N];

int find(int u) {
    while (fa[u] != u) u = fa[u] = fa[fa[u]];
    return u;
}

int x[N], y[N];
vector<int> G[N];
int main() {
    ios::sync_with_stdio(false);

    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        cin >> x[i] >> y[i];
    }

    for (int i = 0; i < 2 * m; i += 2) {
        int u, v;
        cin >> u >> v;
        Point a = {x[u] - x[v], y[u] - y[v]};
        Point b = {x[v] - x[u], y[v] - y[u]};
        e[i] = {u, v, b};
        e[i + 1] = {v, u, a};
        G[u].push_back(i);
        G[v].push_back(i + 1);
        fa[i] = i, fa[i + 1] = i + 1;
        siz[i] = siz[i + 1] = 1;
    }

    for (int i = 1; i <= n; i++) {
        vector<int> eids = G[i];

        auto cmp = [&](int u, int v) {
            argcmp cp;
            return cp(e[u].a, e[v].a);
        };

        sort(eids.begin(), eids.end(), cmp);

        for (int i = 0; i < eids.size(); i++) {
            int nxt = (i + 1) % eids.size();
            int eu = eids[i] ^ 1, ev = eids[nxt];

           // cout <<" conn " << eu<<" and " << ev << endl;
//            cout <<" siz " << siz[find(eu)] <<" , " << siz[find(ev)] << endl;
//            cout <<" f " << find(eu) <<","<< find(ev) << endl;
            if (find(eu) != find(ev)) {

                siz[find(ev)] += siz[find(eu)];
                fa[find(eu)] = find(ev);
                // cout <<" siz " << find(ev) <<" is " << siz[find(ev)] << endl;
            }
        }
    }
    int ans = 1e9;
    for(int i=0;i<2*m;i++){
        ans = min(ans , siz[find(i)]);
    }
    cout << ans <<endl;


}