#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma comment(linker, "/stack:200000000")
using namespace std;
long long spf[301];
long long fac[301];
void sieve() {
  spf[1] = 1;
  for (long long i = 2; i < 301; i++) spf[i] = i;
  for (long long i = 4; i < 301; i += 2) spf[i] = 2;
  for (long long i = 3; i * i < 301; i++) {
    if (spf[i] == i) {
      for (long long j = i * i; j < 301; j += i)
        if (spf[j] == j) spf[j] = i;
    }
  }
}
map<long long, long long> getfactor(long long a) {
  map<long long, long long> m;
  while (a > 1) {
    m[spf[a]]++;
    a /= spf[a];
  }
  return m;
}
long long power(long long x, long long y, long long p) {
  long long res = 1;
  if (x == 0) return 0;
  while (y > 0) {
    if (y & 1) res = (res * x);
    y = y >> 1;
    x = (x * x);
  }
  return res;
}
long long gcd(long long a, long long b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
long long inverse(long long a, long long p) { return power(a, p - 2, p); }
long long ncr(long long n, long long r, long long p) {
  if (r > n) return 0;
  if (r == 0) return 1;
  return (fac[n] * inverse(fac[r], p) % p * inverse(fac[n - r], p) % p) % p;
}
vector<long long> v;
long long g(long long a[], long long j) {
  long long gg = a[1];
  for (long long i = 1; i <= j; i++) gg = gcd(gg, a[i]);
  return gg;
}
void p(long long val) {
  for (long long i = 2; i <= sqrt(val); i++) {
    while (val % i == 0) {
      v.push_back(i);
      val /= i;
    }
  }
  if (val > 1) v.push_back(val);
}
void solve() {
  long long n, m;
  cin >> n >> m;
  long long a[n + 5], b[m + 1];
  for (long long i = 1; i <= n; i++) cin >> a[i];
  for (long long i = 1; i <= m; i++) cin >> b[i];
  for (long long i = n; i >= 1; i--) {
    long long gg = g(a, i);
    if (a[i] == a[i + 1]) continue;
    v.clear();
    p(gg);
    long long count = 0;
    for (auto it : v) {
      auto it2 = lower_bound(b + 1, b + m + 1, it) - b;
      if (it2 != m + 1 && b[it2] == it)
        count++;
      else
        count--;
    }
    if (count > 0)
      for (long long j = i; j >= 1; j--) a[j] /= gg;
  }
  long long ans = 0, count = 0;
  for (long long i = 1; i <= n; i++) {
    if (a[i] != a[i - 1]) {
      count = 0;
      v.clear();
      p(a[i]);
      for (auto it : v) {
        auto it2 = lower_bound(b + 1, b + m + 1, it) - b;
        if (it2 != m + 1 && b[it2] == it)
          count--;
        else
          count++;
      }
    }
    ans += count;
  }
  cout << ans << '\n';
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long test = 1;
  while (test--) {
    solve();
  }
}
