#include <bits/stdc++.h>
using namespace std;
struct Edge {
  int from, to, cap, flow, index;
  Edge(int from, int to, int cap, int flow, int index)
      : from(from), to(to), cap(cap), flow(flow), index(index) {}
};
struct Dinic {
  int N;
  vector<vector<Edge> > G;
  vector<Edge *> dad;
  vector<int> Q;
  Dinic(int N) : N(N), G(N), dad(N), Q(N) {}
  void AddEdge(int from, int to, int cap) {
    G[from].push_back(Edge(from, to, cap, 0, G[to].size()));
    if (from == to) G[from].back().index++;
    G[to].push_back(Edge(to, from, 0, 0, G[from].size() - 1));
  }
  long long BlockingFlow(int s, int t) {
    fill(dad.begin(), dad.end(), (Edge *)NULL);
    dad[s] = &G[0][0] - 1;
    int head = 0, tail = 0;
    Q[tail++] = s;
    while (head < tail) {
      int x = Q[head++];
      for (int i = 0; i < G[x].size(); i++) {
        Edge &e = G[x][i];
        if (!dad[e.to] && e.cap - e.flow > 0) {
          dad[e.to] = &G[x][i];
          Q[tail++] = e.to;
        }
      }
    }
    if (!dad[t]) return 0;
    long long totflow = 0;
    for (int i = 0; i < G[t].size(); i++) {
      Edge *start = &G[G[t][i].to][G[t][i].index];
      int amt = 1000000007;
      for (Edge *e = start; amt && e != dad[s]; e = dad[e->from]) {
        if (!e) {
          amt = 0;
          break;
        }
        amt = min(amt, e->cap - e->flow);
      }
      if (amt == 0) continue;
      for (Edge *e = start; amt && e != dad[s]; e = dad[e->from]) {
        e->flow += amt;
        G[e->to][e->index].flow -= amt;
      }
      totflow += amt;
    }
    return totflow;
  }
  long long GetMaxFlow(int s, int t) {
    long long totflow = 0;
    while (long long flow = BlockingFlow(s, t)) totflow += flow;
    return totflow;
  }
};
long long a[110], u[110], v[110];
int main() {
  long long n, m;
  cin >> n >> m;
  set<long long> prime;
  for (long long k = 0; k < n; ++k) {
    cin >> a[k];
    long long maxi = a[k];
    for (long long i = 2; i * i <= maxi; ++i) {
      if (maxi % i == 0) {
        while (maxi % i == 0) {
          maxi /= i;
        }
        prime.insert(i);
      }
    }
    if (maxi > 1) {
      prime.insert(maxi);
    }
  }
  long long ans = 0;
  for (int i = 0; i < m; ++i) {
    cin >> u[i] >> v[i];
    --u[i];
    --v[i];
    if (v[i] & 1) {
      swap(u[i], v[i]);
    }
  }
  for (auto it = prime.begin(); it != prime.end(); ++it) {
    long long p = *it;
    Dinic g(n + 2);
    for (int i = 0; i < m; ++i) {
      g.AddEdge(u[i], v[i], 1000000007);
    }
    for (int i = 0; i < n; ++i) {
      int num = 0;
      while (a[i] % p == 0) {
        a[i] /= p;
        ++num;
      }
      if (num == 0) continue;
      if (i & 1) {
        g.AddEdge(n, i, num);
      } else
        g.AddEdge(i, n + 1, num);
    }
    ans += g.GetMaxFlow(n, n + 1);
  }
  cout << ans;
  return 0;
}
