# Solution of;
# Project Euler Problem 487: Sums of power sums
# https://projecteuler.net/problem=487
# 
# Let fk(n) be the sum of the kth powers of the first n positive integers. For 
# example, f2(10) = 12 + 22 + 32 + 42 + 52 + 62 + 72 + 82 + 92 + 102 = 385. 
# Let Sk(n) be the sum of fk(i) for 1 ≤ i ≤ n. For example, S4(100) = 
# 35375333830. What is ∑ (S10000(1012) mod p) over all primes p between 2 ⋅ 
# 109 and 2 ⋅ 109 + 2000?
# 
# by lcsm29 http://github.com/lcsm29/project-euler
import timed


def dummy(n):
    pass


if __name__ == '__main__':
    n = 1000
    i = 10000
    prob_id = 487
    timed.caller(dummy, n, i, prob_id)
