#include <iostream>
#include<fstream>
#include<vector>
#include<string>
using namespace std;
const int mod=(1<<17)-1;
vector<int> h[mod+5],modes[mod+5],v[(1<<10)+5];
int a[(1<<10)+5],n,c,i,j,key,sum;
long long tot;
string s;
void ins(int x)
{
    key=x&mod;
    for(int k=0;k<h[key].size();k++)
    {
        if(h[key][k]==x)
        {modes[key][k]++;return;}
    }
    h[key].push_back(x);
    modes[key].push_back(1);
}
int finds(int x)
{
    key=x&mod;
    for(int k=0;k<h[key].size();k++)
    {
        if(h[key][k]==x)
            return modes[key][k];
    }
    return 0;
}
int main()
{
    ifstream f("oite.in");
    ofstream g("oite.out");
    f>>n>>c;f.get();
    getline(f,s);
    i=1;
    while(i<=n)
    {
        if(s[j]>='0'&&s[j]<='9')
            a[i]=a[i]*10+s[j]-'0';
        else {i++;}
        j++;
    }
    for(i=1;i<=n;i++)
    {
        for(j=0;j<v[i-1].size();j++)
            ins(v[i-1][j]);
        for(j=i+1;j<=n;j++)
        {
          sum=a[i]+a[j];
          if(sum<=c)
          {v[j].push_back(sum);
          tot+=finds(c-sum);}
        }
    }
    g<<tot;
    return 0;
}