import eulerlib

def m():
    p=eulerlib.prime_numbers.prime_gen()
    m=2000000
    #m=10
    sum=0
    while True:
        t=next(p)
        if t>m:
            break
        sum=sum+t
    print ("sum=%d" % sum)

#import cProfile
#cProfile.run('m()')
m()