序列查询

#include
using namespace std;
 
#define x first
#define y second
#define endl '\n'
#define rep(i,a,n) for (int i = a; i < n; i ++ )
#define repn(i,a,n) for (int i = a; i <= n; i ++ )
#define pb push_back
#define IOS ios::sync_with_stdio(false); cin.tie(0);cout.tie(0);
typedef long long ll;
typedef pair<int,int> PII;
 
ll gcd(ll a,ll b) { return b ? gcd(b,a % b) : a; }
const int mod = 1e9+7;
int n, k;
const int N = 210;
int a[N];
ll ans;
 
int main()
{
	IOS;
	cin >> n >> k;
	repn(i, 1, n)
	{
		cin >> a[i];
	}
	for (int i = 0; i <= k; i ++ )	ans += lower_bound(a + 1, a + 1 + n, i) - a - 1;
		cout << ans << endl;
	return 0;
}