import std.conv, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = cast(int)(as.length); for (; low + 1 < upp; ) { int mid = (low + upp) >> 1; (test(as[mid]) ? low : upp) = mid; } return upp; }
int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a < val)); }
int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a <= val)); }


enum MO = 1_000_000_009L;

int N, K;
long[] A;

void main() {
  try {
    for (; ; ) {
      N = readInt();
      K = readInt();
      A = new long[N];
      foreach (i; 0 .. N) {
        A[i] = readLong();
      }
      long ansE, ansV;
      if (K > 0) {
        foreach (k; 0 .. K) {
          long x;
          foreach (i; 0 .. N) {
            if ((A[i] >> k) & 1) {
              ++x;
            }
          }
          /*
            E = N / 2
            V = ((x - N / 2)^2 + ((N - x) - N / 2)^2) / 2 = (2 x - N)^2 / 4
          */
          const mul = (1L << k) % MO;
          (ansE += mul * N) %= MO;
          (ansV += ((mul * (2 * x - N)) % MO)^^2) %= MO;
        }
        foreach (_; 0 .. K - 1) {
          (ansE *= 2) %= MO;
          (ansV *= 4) %= MO;
        }
      }
      writeln(ansE);
      writeln(ansV);
    }
  } catch (EOFException e) {
  }
}