1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.OutputStreamWriter;
import java.util.StringTokenizer;

public class sia {

	private static long MAX_LEN = 1_000_000_000_000l;		// 10^12	
	
	public static String solve(Reader in) throws IOException {
		int typesNum = in.nextInt();
		int cutCount = in.nextInt();
		
		int[] speeds = new int[typesNum];
		for (int i=0; i<typesNum; i++) {
			speeds[i] = in.nextInt();
		}
		
		long[] days = new long[cutCount];
		long[] maxLengths = new long[cutCount];
		for (int i=0; i<cutCount; i++) {
			days[i] = in.nextLong();
			maxLengths[i] = in.nextLong();
		}
		
		StringBuilder sb = new StringBuilder();
		
		long previousDay = 0;
		long[] currLengths = new long[typesNum];
		for (int i=0; i<cutCount; i++) {
			long result = 0;
			long dayDiff = days[i] - previousDay;
			long maxLen = maxLengths[i];
			for (int g=0; g<typesNum; g++) {
				long currLen = dayDiff * speeds[g] + currLengths[g];
				if (currLen > MAX_LEN) {
					currLen = MAX_LEN;
				}
				if (currLen > maxLen) {
					result += currLen - maxLen;
					currLen = maxLen;
				}
				currLengths[g] = currLen;
			}
			sb.append(result).append("\n");
			
			previousDay = days[i];
		}
		
		
		return sb.toString();
	}
	

	public static void main(String[] args) throws IOException {
		Reader reader = new Reader(System.in);
		Writer writer = new Writer(System.out);
		String solution = solve(reader); 
		writer.println(solution);
		writer.flush();

	}

	/** Class for buffered reading int, long and double values */
	public static class Reader {
		BufferedReader reader;
		StringTokenizer tokenizer;

		public Reader(InputStream input) {
			reader = new BufferedReader(new InputStreamReader(input));
			tokenizer = new StringTokenizer("");
		}

		/** get next word */
		String next() throws IOException {
			while (!tokenizer.hasMoreTokens()) {
				String str = reader.readLine();
				if (str == null) {
					return null;
				}
				tokenizer = new StringTokenizer(str);
			}
			return tokenizer.nextToken();
		}

		int nextInt() throws IOException {
			return Integer.parseInt(next());
		}

		double nextDouble() throws IOException {
			return Double.parseDouble(next());
		}
		
		long nextLong() throws IOException {
			return Long.parseLong(next());
		}
	}

	/** Class for buffered writing int and double values */
	public static class Writer {
		BufferedWriter writer;

		public Writer(OutputStream out) {
			writer = new BufferedWriter(new OutputStreamWriter(out), 512);
		}
		
		void print(char c) throws IOException {
			writer.write(c);
		}

		void print(String str) throws IOException {
			writer.write(str);
		}

		void println(String str) throws IOException {
			writer.write(str);
			writer.write("\n");
		}

		void println() throws IOException {
			writer.write("\n");
		}

		void flush() throws IOException {
			writer.flush();
		}

		@Override
		protected void finalize() {
			try {
				writer.flush();
			} catch (IOException e) {
				// TODO Auto-generated catch block
				e.printStackTrace();
			}
		}
	}

}