#include <bits/stdc++.h>
using namespace std;
struct point {
  int x, y;
  point() {}
  point(int a, int b) { x = a, y = b; }
};
template <class T>
T sqr(T a) {
  return a * a;
}
template <class T>
T power(T n, T p) {
  T res = 1;
  for (int i = 0; i < p; i++) res *= n;
  return res;
}
template <class T>
double getdist(T a, T b) {
  return sqrt((a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y));
}
template <class T>
T extract(string s, T ret) {
  stringstream ss(s);
  ss >> ret;
  return ret;
}
template <class T>
string tostring(T n) {
  stringstream ss;
  ss << n;
  return ss.str();
}
template <class T>
inline T Mod(T n, T m) {
  return (n % m + m) % m;
}
template <class T>
void show(T a) {
  cout << a << endl;
}
template <class T>
void show(T a, T b) {
  cout << a << ' ' << b << endl;
}
long long arr[200010], node;
vector<long long> factors[200010], id[200010];
void factorize(long long n, int indx) {
  for (long long i = 2; i * i <= n; i++) {
    while (n % i == 0) {
      n /= i;
      factors[indx].push_back(i);
      id[indx].push_back(++node);
    }
  }
  if (n > 1) {
    factors[indx].push_back(n);
    id[indx].push_back(++node);
  }
}
const int INF = 2000000000;
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 = INF;
      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;
  }
};
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  long long n, m, i, u, v, j;
  cin >> n >> m;
  for (i = 1; i <= n; i++) {
    cin >> arr[i];
    factorize(arr[i], i);
  }
  Dinic *flow = new Dinic(node + 2);
  for (i = 1; i <= n; i++) {
    for (j = 0; j < (int)(factors[i].size()); j++) {
      if (i % 2)
        flow->AddEdge(0, id[i][j], 1);
      else
        flow->AddEdge(id[i][j], node + 1, 1);
    }
  }
  while (m--) {
    cin >> u >> v;
    if (u % 2 == 0) swap(u, v);
    for (i = 0; i < (int)(factors[u].size()); i++) {
      for (j = 0; j < (int)(factors[v].size()); j++) {
        if (factors[u][i] == factors[v][j])
          flow->AddEdge(id[u][i], id[v][j], 1);
      }
    }
  }
  cout << flow->GetMaxFlow(0, node + 1) << endl;
  return 0;
}
