import sys
try:
    n = int(sys.stdin.readline().strip() or exit())
    m = int(sys.stdin.readline().strip() or exit())
    sys.stdin.readline() 
    adj = [[] for _ in range(n + 1)]
    for _ in range(m):
        u, v = map(int, sys.stdin.readline().strip().split())
        adj[u].append(v)
        adj[v].append(u)
    res = 0
    for i in range(1, n + 1):
        d = len(adj[i])
        if d == 1: res += 1
        elif d > 1: res += sum(i % j == 0 or j % i == 0 for j in adj[i])
    print(res)
except (IOError, ValueError, IndexError): pass

def solution(word, skeletons):
    ms = []
    for skl in skeletons:
        cf = True
        sksc = set(c for c in skl if c != '-')
        for i in range(len(word)):
            wc = word[i]
            skc = skl[i]
            if skc == '-':
                if wc not in sksc:
                    cf = False
                    break
            elif wc != skc:
                cf = False
                break
        if cf:
            ms.append(skl)
    return ms