a , k = list(map(int,input().split()))
b = list(map(int,input().split()))
count = 0
pointer = False
for i in range(a):
if b[i] <= k:
count += 1
else:
pointer = i+1
break
if pointer != False:
for i in range(a-1 , pointer-1 , -1):
if b[i] <= k:
count += 1
else:
break
print(count)
#include <iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int n, k , c;
cin>>n>>k;
vector<int>a(n);
for( int i = 0; i < n; i++){
cin>>c;
a[i]= c;}
int ans = 0 , z = -1;
for( int i = 0 ; i < n; i++){
if(a[i] > k){
z = i;
break;}
else{
ans++;}}
if( z == -1 && a[0] <= k){
z = n-1;}
for( int i = n-1; i > z; --i){
if(a[i] > k){
break;}
else{
ans++;}}
cout<<ans;
return 0;}1485A - Add and Divide | 337B - Routine Problem |
1392D - Omkar and Bed Wars | 76E - Points |
762C - Two strings | 802M - April Fools' Problem (easy) |
577B - Modulo Sum | 1555B - Two Tables |
1686A - Everything Everywhere All But One | 1469B - Red and Blue |
1257B - Magic Stick | 18C - Stripe |
1203B - Equal Rectangles | 1536A - Omkar and Bad Story |
1509A - Average Height | 1506C - Double-ended Strings |
340A - The Wall | 377A - Maze |
500A - New Year Transportation | 908D - New Year and Arbitrary Arrangement |
199A - Hexadecimal's theorem | 519C - A and B and Team Training |
631A - Interview | 961B - Lecture Sleep |
522A - Reposts | 1166D - Cute Sequences |
1176A - Divide it | 1527A - And Then There Were K |
1618E - Singers' Tour | 1560B - Who's Opposite |