/*
-------------------------------------------------
   Author:       wry
   date:         2022/3/1 17:10
   Description:  test
-------------------------------------------------
 
*/

#include <bits/stdc++.h>

using namespace std;

const int MAXN = 1e5+10;

int project[MAXN];    //商品長度資訊

int main() {
    int n,l,number=0;
    cin >> n >> l;
    for (int i=0;i<n;i++) {
        cin >> project[i];
    }
    sort(project,project+n);    //從小到大
    int i=0,j=n-1;
    
 
while(i<=j) {
        if (i==j) {
            number++;
            break;
        }
        else {    //p<q
            if (project[i]+project[j]<=l) {
                number++;
                i++;
                j--;
            }
            else {
                number++;
                j--;
            }
        }
    }
    cout << number << endl;
    return 0;
}