fn read() -> (Vec<u32>, Vec<Vec<usize>>) {
    let mut s = String::new();
    use std::io::Read;
    std::io::stdin().read_to_string(&mut s).unwrap();
    let mut it = s.trim().split_whitespace();
    let mut next = || it.next().unwrap().parse::<usize>().unwrap();
    let n = next();
    let q = next();
    let a = (0..n).map(|_| next() as u32).collect::<Vec<_>>();
    let ask = (0..q)
        .map(|_| {
            let m = next();
            (0..m).map(|_| next()).collect::<Vec<_>>()
        })
        .collect::<Vec<_>>();
    (a, ask)
}

fn main() {
    let (a, ask) = read();
    let n = a.len();
    let q = ask.len();
    let mut query = vec![vec![]; a.len()];
    for (i, mut ask) in ask.into_iter().enumerate() {
        ask.insert(0, 0);
        ask.push(a.len());
        for a in ask.windows(2) {
            let (l, r) = (a[0], a[1]);
            query[l].push((r, i));
        }
    }
    const MOD: u64 = 1_000_000_007;
    let mut pow = vec![1; n + 1];
    for i in 1..=n {
        pow[i] = 2 * pow[i - 1] % MOD;
    }
    let mut ans = vec![1; q];
    let mut index = [(n, 0); 32];
    for (l, (a, query)) in a.iter().zip(query.iter()).enumerate().rev() {
        let mut q = (l, *a);
        for (j, p) in index.iter_mut().enumerate() {
            if q.1 >> j & 1 == 0 {
                continue;
            }
            if p.0 == n {
                *p = q;
                break;
            }
            if q.0 < p.0 {
                std::mem::swap(&mut q, p);
            }
            q.1 ^= p.1;
        }
        for &(r, k) in query.iter() {
            ans[k] = ans[k] * pow[r - l - index.iter().filter(|x| x.0 < r).count()] % MOD;
        }
    }
    use std::io::Write;
    let out = std::io::stdout();
    let mut out = std::io::BufWriter::new(out.lock());
    for a in ans {
        writeln!(out, "{}", a).ok();
    }
}