JATC loves Banh-mi (a Vietnamese food). His affection for Banh-mi is so much that he always has it for breakfast. This morning, as usual, he buys a Banh-mi and decides to enjoy it in a special way.

First, he splits the Banh-mi into n parts, places them on a row and numbers them from 1 through n. For each part i, he defines the deliciousness of the part as x_i ∈ \{0, 1\}. JATC's going to eat those parts one by one. At each step, he chooses arbitrary remaining part and eats it. Suppose that part is the i-th part then his enjoyment of the Banh-mi will increase by x_i and the deliciousness of all the remaining parts will also increase by x_i. The initial enjoyment of JATC is equal to 0.

For example, suppose the deliciousness of 3 parts are [0, 1, 0]. If JATC eats the second part then his enjoyment will become 1 and the deliciousness of remaining parts will become [1, \\_, 1]. Next, if he eats the first part then his enjoyment will become 2 and the remaining parts will become [\\_, \\_, 2]. After eating the last part, JATC's enjoyment will become 4.

However, JATC doesn't want to eat all the parts but to save some for later. He gives you q queries, each of them consisting of two integers l_i and r_i. For each query, you have to let him know what is the maximum enjoyment he can get if he eats all the parts with indices in the range [l_i, r_i] in some order.

All the queries are independent of each other. Since the answer to the query could be very large, print it modulo 10^9+7.

Input

The first line contains two integers n and q (1 ≤ n, q ≤ 100 000).

The second line contains a string of n characters, each character is either '0' or '1'. The i-th character defines the deliciousness of the i-th part.

Each of the following q lines contains two integers l_i and r_i (1 ≤ l_i ≤ r_i ≤ n) — the segment of the corresponding query.

Output

Print q lines, where i-th of them contains a single integer — the answer to the i-th query modulo 10^9 + 7.

Examples

Input

4 2
1011
1 4
3 4


Output

14
3


Input

3 2
111
1 2
3 3


Output

3
1

Note

In the first example: 

  * For query 1: One of the best ways for JATC to eats those parts is in this order: 1, 4, 3, 2. 
  * For query 2: Both 3, 4 and 4, 3 ordering give the same answer. 



In the second example, any order of eating parts leads to the same answer.
import java.io.*;
import java.util.*;

public class TaskC
{
	public static void main(String[] args)
	{
		new TaskC(System.in, System.out);
	}

	static class Solver implements Runnable
	{
		static final long MOD = (long) 1e9 + 7;
		int n, q;
		char[] s;
		int[] arr;
		long[] tree;
		BufferedReader in;
//		InputReader in;
		PrintWriter out;

		void solve() throws IOException
		{
			String[] tok = in.readLine().split(" ");

			n = Integer.parseInt(tok[0]);
			q = Integer.parseInt(tok[1]);
			s = in.readLine().toCharArray();
			arr = new int[n];
			tree = new long[n << 2];

			for (int i = 0; i < n; i++)
			{
				if (s[i] == '1')
					arr[i] = 1;
			}

			buildTree(1, 0, n - 1);

			while (q-- > 0)
			{
				tok = in.readLine().split(" ");

				int l = Integer.parseInt(tok[0]) - 1;
				int r = Integer.parseInt(tok[1]) - 1;
				long size = (r - l);
				long ones = queryTree(1, 0, n - 1, l, r);
				long zeroes = size + 1 - ones;
				long a = CMath.modPower(2, ones, MOD) - 1;

				if (a < 0)
					a += MOD;

				long x = CMath.modPower(2, zeroes, MOD) - 1;

				if (x < 0)
					x += MOD;

				long b = CMath.mod(a * x, MOD);
//				System.out.println("ones : " + ones + ", 2^ones - 1 : " + a);

				out.println(CMath.mod(a + b, MOD));

/*				System.out.println("l : " + l + ", r : " + r + ", size : " + size);
				System.out.println("query : " + queryTree(1, 0, n - 1, l, r));

				out.println(queryTree(1, 0, n - 1, l, r) + (size * (size + 1) / 2));*/
			}
		}

		void buildTree(int node, int treeStart, int treeEnd)
		{
			if (treeStart > treeEnd)
				return;

			// i.e., leaf node
			if (treeStart == treeEnd)
			{
				tree[node] = arr[treeStart];

				return;
			}

			int mid = (treeStart + treeEnd) / 2;

			// left child
			buildTree(2 * node, treeStart, mid);
			// right child
			buildTree(2 * node + 1, mid + 1, treeEnd);

//			tree[node] = Math.max(tree[2 * node], tree[2 * node + 1]);
			tree[node] = tree[2 * node] + tree[2 * node + 1];
		}

		long queryTree(int node, int treeStart, int treeEnd, int rangeStart, int rangeEnd)
		{
			// if the query range is completely out of the range that this node stores information of
			if (treeStart > treeEnd || treeStart > rangeEnd || treeEnd < rangeStart)
				return 0;

			// if the range that this node holds is completely inside of the qeury range
			if (treeStart >= rangeStart && treeEnd <= rangeEnd)
				return tree[node];

			int mid;
			long leftChildMax, rightChildMax;

			mid = (treeStart + treeEnd) / 2;
			leftChildMax = queryTree(2 * node, treeStart, mid, rangeStart, rangeEnd);
			rightChildMax = queryTree(2 * node + 1, mid + 1, treeEnd, rangeStart, rangeEnd);

			return leftChildMax + rightChildMax;
		}

		public Solver(BufferedReader in, PrintWriter out)
		{
			this.in = in;
			this.out = out;
		}

		@Override public void run()
		{
			try
			{
				solve();
			}
			catch (IOException e)
			{
				e.printStackTrace();
			}
		}

	}

	static class CMath
	{
		static long power(long number, long power)
		{
			if (number == 1 || number == 0 || power == 0)
				return 1;

			if (power == 1)
				return number;

			if (power % 2 == 0)
				return power(number * number, power / 2);
			else
				return power(number * number, power / 2) * number;
		}

		static long modPower(long number, long power, long mod)
		{
			if (number == 1 || number == 0 || power == 0)
				return 1;

			number = mod(number, mod);

			if (power == 1)
				return number;

			long square = mod(number * number, mod);

			if (power % 2 == 0)
				return modPower(square, power / 2, mod);
			else
				return mod(modPower(square, power / 2, mod) * number, mod);
		}

		static long moduloInverse(long number, long mod)
		{
			return modPower(number, mod - 2, mod);
		}

		static long mod(long number, long mod)
		{
			return number - (number / mod) * mod;
		}

		static int gcd(int a, int b)
		{
			if (b == 0)
				return a;
			else
				return gcd(b, a % b);
		}

		static long min(long... arr)
		{
			long min = arr[0];

			for (int i = 1; i < arr.length; i++)
				min = Math.min(min, arr[i]);

			return min;
		}

		static long max(long... arr)
		{
			long max = arr[0];

			for (int i = 1; i < arr.length; i++)
				max = Math.max(max, arr[i]);

			return max;
		}

		static int min(int... arr)
		{
			int min = arr[0];

			for (int i = 1; i < arr.length; i++)
				min = Math.min(min, arr[i]);

			return min;
		}

		static int max(int... arr)
		{
			int max = arr[0];

			for (int i = 1; i < arr.length; i++)
				max = Math.max(max, arr[i]);

			return max;
		}

	}

	static class Utils
	{
		static boolean nextPermutation(int[] arr)
		{
			for (int a = arr.length - 2; a >= 0; --a)
			{
				if (arr[a] < arr[a + 1])
				{
					for (int b = arr.length - 1; ; --b)
					{
						if (arr[b] > arr[a])
						{
							int t = arr[a];

							arr[a] = arr[b];
							arr[b] = t;

							for (++a, b = arr.length - 1; a < b; ++a, --b)
							{
								t = arr[a];
								arr[a] = arr[b];
								arr[b] = t;
							}

							return true;
						}
					}
				}
			}

			return false;
		}

	}

	public TaskC(InputStream inputStream, OutputStream outputStream)
	{
//		uncomment below line to change to BufferedReader
		BufferedReader in = new BufferedReader(new InputStreamReader(inputStream));
		PrintWriter out = new PrintWriter(outputStream);
		Thread thread = new Thread(null, new Solver(in, out), "TaskC", 1 << 29);

		try
		{
			thread.start();
			thread.join();
		}
		catch (InterruptedException e)
		{
			e.printStackTrace();
		}
		finally
		{
			try
			{
				in.close();
			}
			catch (IOException e)
			{
				e.printStackTrace();
			}

			out.flush();
			out.close();
		}
	}

}

/*

5 3
00000
1 3
1 5
2 4

5 3
10000
1 5
1 3
2 5

*/
