#include <iostream> #define int long long using namespace std; const int N = 1e06 + 15; int a[N], sum; int Max(int b[N], int l, int r) { if (l == r) return b[l]; int maxn = -1e8; for (int i = l; i <= r; i++) { maxn = max(b[i], maxn); } return maxn; } int Min(int b[N], int l, int r) { if (l == r) return b[l]; int minn = 1e8; for (int i = l; i <= r; i++) { minn = min(b[i], minn); } return minn; } signed main() { int n, x; cin >> n >> x; for (int i = 0; i < n; i++) { cin >> a[i]; } for (int i = 0; i < n; i++) { for (int j = i; j < n; j++) { if (Max(a, i, j) + Min(a, i, j) == x) { sum++; } } } cout << sum << endl; return 0; }