python求素数

import math
# 判断素数
def prime(n):
    if n < 2:
        return False
    else:
        for i in range(2, int(math.sqrt(n)) + 1):
            if n % i == 0:
                return False
    return True

def PrimeSum(m, n):
    sum = 0
    for i in range(m, n + 1):
        if prime(i):
            sum = sum + i
    return sum

m, n = input().split()
m = int(m)
n = int(n)
print(PrimeSum(m, n))