ACM_10000h的专栏

You are given the longs N and K. You are also given an int M. Compute and return the number of different graphs Bob may construct, modulo M.

You are given three ints: n, k, and m. For each i between 1 and n, inclusive, Fox Ciel calculated the number i^(2^k - 1). ("^" denotes exponentiation.) Return the sum of all numbers Fox Ciel calculated, modulo m.