1. 1
2. 2
3. 3
4. 4
5. 5
6. 6
7. 7
8. 8
9. 9
10. 10
11. 11
12. 12
13. 13
14. 14
15. 15
16. 16
17. 17
18. 18
19. 19
20. 20
21. 21
22. 22
23. 23
24. 24
25. 25
26. 26
27. 27
28. 28
29. 29
30. 30
31. 31
32. 32
33. 33
34. 34
35. 35
36. 36
37. 37
38. 38
39. 39
40. 40

#include <bits/stdc++.h>
#define f first
#define s second
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
constexpr int MAX = 1e6;

int A[5005], cnt[5005] = { 0 }, M[2000002];
ll ans[100001] = { 0 };
vector<pair<ii, int>> q;

int main() {
	ifstream cin("threesum.in");
	ofstream cout("threesum.out");

	int N, Q; cin >> N >> Q;
	for (int i = 0; i < N; ++i) cin >> A[i];
	for (int i = 0; i < Q; ++i) {
		int a, b; cin >> a >> b;
		if (a != b) q.emplace_back(ii(--a, --b), i);
	}
	sort(begin(q), end(q), [](const pair<ii, int>& a, const pair<ii, int>& b) {
		return a.f.s < b.f.s || (a.f.s == b.f.s && a.f.f > b.f.f);
	});
	
	auto it = begin(q);
	for (int i = 0; i < N; ++i) {
		ll sum = 0;
		for (int j = i - 1; j >= 0; --j) {
			int tmp = A[i] + A[j] + MAX;
			if (tmp > 0 && tmp <= 2 * MAX && M[tmp]) cnt[j] += M[tmp];
			++M[-A[j] + MAX];
			sum += cnt[j];
			while (it != end(q) && ii(j, i) == it->f) ans[(it++)->s] = sum;
		}
		for (int j = i - 1; j >= 0; --j) --M[-A[j] + MAX];
	}
	for (int i = 0; i < Q; ++i) cout << ans[i] << '\n';
}