#include<bits/stdc++.h>
using namespace std;
int n, ans;
long long k, a[100010];
long long pj(int i, int j) //整数i与整数j拼接
{
    long long tj = j, sj = 1;
    while (tj > 0)
    {
        sj *= 10;    //算出整数j的位数
        tj /= 10;
    }
    return i * sj + j;
}
int main()
{
    cin >> n >> k;
    for (int i = 1; i <= n; i++) cin >> a[i];
    sort(a + 1, a + n + 1); //将数组从小到大排列
    int i = 1, j = n;
    while (i != j)
    {
        long long t = pj(a[i], a[j]);
        if (t <= k)
        {
            ans += j - i;    //如果小于等于k，那么统计答案
            i++;
        }
        else j--; //否则移动j指针，缩小范围
    }
    //反着再拼一遍
    i = 1;
    j = n;
    while (i != j)
    {
        long long t = pj(a[j], a[i]);
        if (t <= k)
        {
            ans += j - i;
            i++;
        }
        else j--;
    }
    cout << ans;
    return 0;
}