MOD = 1000000009
n, k = map(int, input().strip().split())
a = map(int, input().strip().split())
if k == 0:
    print(0)
    print(0)
else:
    ans1 = n * (pow(2, k, MOD) + MOD - 1) * pow(2, k - 1, MOD) % MOD
    print(ans1)
    cnt = [0 for i in range(k)]
    for x in a:
        for i in range(k):
            if (x & (1 << i)) == 0:
                cnt[i] += 1
    
    ans2 = 0
    for i in range(k):
        ans2 = (ans2 + (cnt[i] * cnt[i] + (n - cnt[i]) * (n - cnt[i])) * pow(2, i * 2, MOD)) % MOD
    ans2 = ans2 * 2 % MOD
    
    for i in range(k):
        for j in range(k):
            if i == j:
                continue 
            ans2 = (ans2 + n * n * pow(2, i + j, MOD)) % MOD
    ans2 = ans2 * pow(2, 2 * (k - 1)) % MOD
    ans2 = (ans2 + MOD - ans1 * ans1 % MOD) % MOD
    print(ans2)