5：6-2 使用函数求素数和（处理PTA非零返回问题）

在结尾加exit(0), 至于为何就不清楚了

def prime(p):
    prime = True
    if p == 1:
        prime = False
    else:
        for i in range(2, int(p**(1/2)+1)):
            if p%i == 0:
                prime = False
    return prime

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

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