Ehab has an array a of n integers. He likes the [bitwise-xor operation](https://en.wikipedia.org/wiki/Bitwise_operation#XOR) and he likes to bother Mahmoud so he came up with a problem. He gave Mahmoud q queries. In each of them, he gave Mahmoud 2 integers l and x, and asked him to find the number of subsequences of the first l elements of the array such that their bitwise-xor sum is x. Can you help Mahmoud answer the queries?

A subsequence can contain elements that are not neighboring.

Input

The first line contains integers n and q (1 ≤ n, q ≤ 105), the number of elements in the array and the number of queries.

The next line contains n integers a1, a2, ..., an (0 ≤ ai < 220), the elements of the array.

The next q lines, each contains integers l and x (1 ≤ l ≤ n, 0 ≤ x < 220), representing the queries.

Output

For each query, output its answer modulo 109 + 7 in a newline.

Examples

Input

5 5
0 1 2 3 4
4 3
2 0
3 7
5 7
5 8


Output

4
2
0
4
0


Input

3 2
1 1 1
3 1
2 0


Output

4
2

Note

The bitwise-xor sum of the empty set is 0 and the bitwise-xor sum of a set containing one element is that element itself.
// Main Code at the Bottom
import java.util.*;
import java.util.regex.Matcher;
import java.util.regex.Pattern;
import java.io.*; 
public class Main{
	//Fast IO class
    static class FastReader {
        BufferedReader br; 
        StringTokenizer st; 
        public FastReader() {
        	boolean env=System.getProperty("ONLINE_JUDGE") != null;
        	if(!env) {
        		try {
					br=new BufferedReader(new FileReader("input.txt"));
				} catch (FileNotFoundException e) {
					e.printStackTrace();
				}
        	}
        	else br = new BufferedReader(new InputStreamReader(System.in)); 
        } 
        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine()); 
                } 
                catch (IOException  e) {
                    e.printStackTrace(); 
                } 
            } 
            return st.nextToken(); 
        } 
        int nextInt() {
            return Integer.parseInt(next()); 
        } 
        long nextLong() {
            return Long.parseLong(next()); 
        } 
        double nextDouble() {
            return Double.parseDouble(next()); 
        } 
        String nextLine() {
            String str = ""; 
            try {
                str = br.readLine(); 
            } 
            catch (IOException e) {
                e.printStackTrace(); 
            } 
            return str; 
        } 
    }     
    static long MOD=(long)1e9+7;
    //debug
    static void debug(Object... o) {
        System.out.println(Arrays.deepToString(o));
    }
    static FastReader sc=new FastReader();
    static PrintWriter out=new PrintWriter(System.out);  
    //Global variables and functions
    static int basis[] = new int[21];
    static void add(int x) {
    	for(int i = 0; i <= 20; i++) {
    		if(((x>>i)&1) == 0) continue;
    		if(basis[i] == 0) {
    			basis[i] = x;
    			return;
    		}
    		x ^= basis[i];
    	}
    }
    static boolean query(int x, int basis[]) {
    	for(int i = 0; i <= 20; i++) {
    		if(((x>>i)&1) == 0) continue;
    		if(basis[i] == 0) return false;
    		x ^= basis[i];
    	}
    	return true;
    }
    //Main function(The main code starts from here)
    public static void main (String[] args) throws java.lang.Exception {
    	int test=1;
    	//test=sc.nextInt();
    	while(test-->0) {
    		int n  = sc.nextInt(), q = sc.nextInt();
    		int pre[][] = new int[n][21];
    		int pow[] = new int[n+1];
    		pow[0] = 1;
    		for(int i = 0; i <= n; i++) {
    			if(i < n) {
    				add(sc.nextInt());
        			pre[i] = Arrays.copyOf(basis, 21);
    			}
    			if(i > 0) {
    				long val = (2L*(long)pow[i-1])%MOD;
    				pow[i] = (int)val;
    			}
    		}
    		while(q-- > 0) {
    			int l = sc.nextInt() - 1, x = sc.nextInt();
    			if(!query(x, pre[l])) {
    				out.println(0);
    				continue;
    			}
    			int sz = 0;
    			for(int i = 0; i <= 20; i++) if(pre[l][i] != 0) sz++;
    			out.println(pow[l+1-sz]);
    		}
    		
    	}
        out.flush();
        out.close();
    }
}