#include "triples.h"
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
#define pb push_back
#define st first
#define nd second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define all(a) a.begin(), a.end()
set<pair<pii, int>> S;
pair<pii, int> sor(int a, int b, int c) {
if (b > c) swap(b, c);
if (a > b) swap(b, a);
if (b > c) swap(b, c);
return {{a, b}, c};
}
long long count_triples(std::vector<int> T) {
int n = T.size();
ll ans = 0;
rep(i, n) {
int j = i + T[i];
int k[4];
if (j < n) {
k[0] = i + T[j];
k[1] = i - T[j];
k[2] = j + T[j];
k[3] = j - T[j];
rep(c, 4) {
if (i == j || i == k[c] || j == k[c]) continue;
if (k[c] < 0 || k[c] >= n) continue;
int x = T[i];
int y = T[j];
int z = T[k[c]];
if ((x + y + z) != (2 * max({x, y, z}))) continue;
S.insert(sor(x, y, z));
}
}
j = i - T[i];
if (j >= 0) {
k[0] = i + T[j];
k[1] = i - T[j];
k[2] = j + T[j];
k[3] = j - T[j];
rep(c, 4) {
if (i == j || i == k[c] || j == k[c]) continue;
if (k[c] < 0 || k[c] >= n) continue;
int x = T[i];
int y = T[j];
int z = T[k[c]];
if ((x + y + z) != (2 * max({x, y, z}))) continue;
S.insert(sor(x, y, z));
}
}
}
ans = (long long) S.size();
return ans;
}
std::vector<int> construct_range(int M, int K) {
return {1, 1, 1};
}
