#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b, int mod=M) {
    int x = 1;
    a %= mod;
    while (b) {
        if (b & 1) x = (x * a) % mod; 
        a = (a * a) % mod;
        b >>= 1;
    }
    return x;
}


//_ ***************************** START Below *******************************




vector<int> a;
vector<int> b;

int consistency(int m, int n){

    unordered_map<int,int> countA, countB;

    for(int i=0; i<m; i++){
        countA[a[i]]++;
    }
    for(int i=0; i<n; i++){
        countB[b[i]]++;
    }

    int M = 1e6+1;
    vector<int> seive(M+2);

    for(auto& it : countA){
        int x = it.first;
        int ct = it.second;

        for(int j=x; j<=M+1; j+=x){
            seive[j] += ct;
        }
    }

    int ans = 0;
    for(int i=1; i<=M+1; i++){
        if(countB.count(i)){
            ans += countB[i]*seive[i];
        }
    }

    return ans;



}















int practice(int m, int n){


    return 0;
}





void solve() {
    
    int m, n;
    cin>> m >> n;
    
    a.resize(m);
    b.resize(n);
    for(int i=0; i<m; i++) cin >> a[i];
    for(int i=0; i<n; i++) cin >> b[i];
    
    cout << consistency(m, n) << endl;


}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}