#[allow(unused_imports)]
use std::cmp::*;
#[allow(unused_imports)]
use std::collections::*;
use std::io::Read;

#[allow(dead_code)]
fn getline() -> String {
    let mut ret = String::new();
    std::io::stdin().read_line(&mut ret).ok().unwrap();
    ret
}

fn get_word() -> String {
    let stdin = std::io::stdin();
    let mut stdin=stdin.lock();
    let mut u8b: [u8; 1] = [0];
    loop {
        let mut buf: Vec<u8> = Vec::with_capacity(16);
        loop {
            let res = stdin.read(&mut u8b);
            if res.unwrap_or(0) == 0 || u8b[0] <= b' ' {
                break;
            } else {
                buf.push(u8b[0]);
            }
        }
        if buf.len() >= 1 {
            let ret = String::from_utf8(buf).unwrap();
            return ret;
        }
    }
}

#[allow(dead_code)]
fn get<T: std::str::FromStr>() -> T { get_word().parse().ok().unwrap() }

fn main() {
    // In order to avoid potential stack overflow, spawn a new thread.
    let stack_size = 104_857_600; // 100 MB
    let thd = std::thread::Builder::new().stack_size(stack_size);
    thd.spawn(|| solve()).unwrap().join().unwrap();
}

fn pow(a: u32, mut e: usize) -> u32 {
    let mut prod = 1u32;
    let mut cur = a;
    while e > 0 {
        if e % 2 == 1 {
            prod = prod.wrapping_mul(cur);
        }
        cur = cur.wrapping_mul(cur);
        e /= 2;
    }
    prod
}

fn solve() {
    let t: usize = get();
    for _ in 0..t {
        let n: usize = get();
        let m: usize = get();
        let mut a: Vec<u32> = (0..n).map(|_| get()).collect();
        if n >= 30 {
            let mut acc = vec![0u32; n + 1];
            for i in 0..n {
                acc[i + 1] = acc[i].wrapping_add(pow(a[i], n - 30));
            }
            let mut b = vec![0u32; 30];
            for i in 0..30 {
                b[i] = acc[n - 30 + i].wrapping_sub(acc[i]);
            }
            a = b;
        }
        while a.len() > 1 {
            let mut b = vec![0; a.len() - 1];
            for i in 0..a.len() - 1 {
                let tmp = a[i].wrapping_add(a[i + 1]);
                b[i] = tmp.wrapping_mul(tmp);
            }
            a = b;
        }
        println!("{}", a[0] & ((1 << m) - 1));
    }
}