//https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8 より
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};
    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };
    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };
    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };
    ($iter:expr, bytes) => {
        read_value!($iter, String).bytes().collect::<Vec<u8>>()
    };
    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };
    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}

//

fn solve(a: &mut [(i32, i32, u32, usize)], b: &mut [(i32, i32, u32, usize)], k: i32) -> usize {
    a.sort_by_key(|a| (a.0, a.1));
    b.sort_by_key(|b| (b.0, -b.1));
    let mut res = 0;
    let mut p = b.len();
    let mut cnt = 0;
    let mut sum = 0;
    let mut prev = k + 1;
    for &(a, min_a, _, len) in a.iter() {
        if prev + a > k {
            cnt = 0;
            sum = 0;
        }
        prev = k - a;
        while p > 0 && b[p - 1].0 + a > k {
            p -= 1;
        }
        while p > 0 && b[p - 1].0 + a == k && b[p - 1].1 < min_a {
            if b[p - 1].2 == 1 {
                cnt += 1;
                sum += b[p - 1].3;
            }
            p -= 1;
        }
        res += cnt * len + sum;
    }
    res
}

fn calc(a: &[i32], k: i32) -> usize {
    let n = a.len();
    if n == 1 {
        return if a[0] * 2 == k {
            1
        } else {
            0
        };
    }
    let m = n / 2;
    let (l, r) = a.split_at(m);
    let mut ans = calc(l, k) + calc(r, k);
    let mut left = vec![(0, 0, 0, 0); l.len()];
    let mut val = (std::i32::MAX, 0);
    for (i, (left, &l)) in left.iter_mut().zip(l.iter()).rev().enumerate() {
        if val.0 > l {
            val = (l, 1);
        } else if val.0 == l {
            val.1 += 1;
        }
        *left = (l, val.0, val.1, i + 1);
    }
    let mut right = vec![(0, 0, 0, 0); r.len()];
    let mut val = (std::i32::MAX, 0);
    for (i, (left, &l)) in right.iter_mut().zip(r.iter()).enumerate() {
        if val.0 > l {
            val = (l, 1);
        } else if val.0 == l {
            val.1 += 1;
        }
        *left = (l, val.0, val.1, i + 1);
    }
    ans += solve(&mut left, &mut right, k);
    ans += solve(&mut right, &mut left, k);
    ans
}

fn run() {
    input! {
        n: usize,
        k: i32,
        a: [i32; n],
    }
    let ans = calc(&a, k);
    println!("{}", ans);
}

fn main() {
    run();
}