#include <bits/stdc++.h>
#define int long long
using namespace std;
int a[100001], n, k, b, ans, r, l = 1;
int f(int a1, int a2) {
	int sum = 0;
	int a1_ = a1, a2_ = a2, a1w = 0, a2w = 0;
	while(a1) {
		a1w ++;
		a1 /= 10;
	}
	while(a2) {
		a2w ++;
		a2 /= 10;
	}
	sum += pow(10,a2w) * a1_ + a2_;
	return sum;
}
int f2(int a1, int a2) {
	int sum = 0;
	int a1_ = a1, a2_ = a2, a1w = 0, a2w = 0;
	while(a1) {
		a1w ++;
		a1 /= 10;
	}
	while(a2) {
		a2w ++;
		a2 /= 10;
	}
	sum += pow(10,a1w) * a2_ + a1_;
	return sum;
}
signed main(){
	cin >> n >> k;
	for(int i = 1;i <= n;i ++) cin >> a[i];
	sort(a + 1,a + n + 1);
	r = n;
	for(int i = 1;i <= n;i ++) {
		for(int j = i + 1;j <= n;j ++) {
			if(f(a[i],a[j]) <= k) ans ++;
			else break;
			if(f(a[j],a[i]) <= k) ans ++;
			//else break;
		}
	}
	cout << ans;
	return 0;
}

后面的没有全TLE，wa了一半又TLE了一半