#include #include #include #include #include #include #include #include #include #include #include #include #include #include #define rep(i, a, b) for (int i = (a); i < (b); ++i) #define MOD 1000000007 #define int long long using ll = long long; using namespace std; const int INF = 1LL << 50; using P = pair; template bool chmin(T &a, T b) { if (a > b) { a = b; return true; } else { return false; } } template bool chmax(T &a, T b) { if (a < b) { a = b; return true; } else { return false; } } struct Setup { Setup() { cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); } } SETUP; map prime_factorize(ll x) { map primes; for (ll p = 2; p * p <= x; p++) { while (x % p == 0) { primes[p]++; x /= p; } } if (x != 1) primes[x] = 1; return primes; } signed main() { int n; cin >> n; int k; cin >> k; int cur = 1; rep(i, 1, n) { int a; cin >> a; if (k < a) { cur++; } cout << cur << endl; } }