#include <bits/stdc++.h>
using namespace std;
long long spf[300001];
long long fac[300001];
void sieve() {
  spf[1] = 1;
  for (long long i = 2; i < 300001; i++) spf[i] = i;
  for (long long i = 4; i < 300001; i += 2) spf[i] = 2;
  for (long long i = 3; i * i < 300001; i++) {
    if (spf[i] == i) {
      for (long long j = i * i; j < 300001; j += i)
        if (spf[j] == j) spf[j] = i;
    }
  }
}
map<long long, long long> getfactor(long long a) {
  map<long long, long long> m;
  while (a > 1) {
    m[spf[a]]++;
    a /= spf[a];
  }
  return m;
}
long long power(long long x, long long y, long long p) {
  long long res = 1;
  x = x;
  if (x == 0) return 0;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
long long gcd(long long a, long long b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
long long inverse(long long a, long long p) { return power(a, p - 2, p); }
long long ncr(long long n, long long r, long long p) {
  if (r == 0) return 1;
  return (fac[n] * inverse(fac[r], p) % p * inverse(fac[n - r], p) % p) % p;
}
void solve() {
  long long n, m, c;
  cin >> n >> m >> c;
  long long vis[n + 5];
  for (long long i = 1; i <= n + 1; i++) vis[i] = 0;
  vis[0] = -1e18;
  for (long long i = 1; i <= m; i++) {
    long long p, flag = 0;
    cin >> p;
    if (p > c / 2) {
      long long j = n;
      while (vis[j] >= p && j > 0) j--;
      cout << j << endl;
      vis[j] = p;
    } else {
      long long j = 1;
      while (vis[j] <= p && j <= n && vis[j] != 0) j++;
      cout << j << endl;
      vis[j] = p;
    }
    for (long long j = 1; j <= n; j++) {
      if (vis[j] == 0) flag++;
    }
    if (!flag) return;
  }
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long t = 1;
  while (t--) {
    solve();
  }
}
