7 7 7
1
2
3
4
5
6
7
 4 2 8
1
3
4
2
3
4
1
2
 9 4 9
1
2
3
4
5
6
7
8
9
 7 5 7
1
2
3
4
5
6
7
 15 10 15
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
 4 0 4
1
2
3
4
 12 2 12
1
2
3
4
5
6
7
8
9
10
11
12
 10 2 10
1
2
3
4
5
6
7
8
9
10
 7 4 7
1
2
3
4
5
6
7
 7 3 7
1
2
3
4
5
6
7

XXXXXXX
 ..XX.X.X
 ...X.X.XX
 .X.XXXX
 .X.X.X.X.XXXXXX
 ....
 .........X.X
 .......X.X
 .X.X.XX
 ...X.XX

#include <bits/stdc++.h>
using namespace std;
const long long INF = (long long)2e18;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long n, k, p;
  cin >> n >> k >> p;
  vector<long long> v(p);
  for (long long i = 0; i < p; i++) {
    cin >> v[i];
  }
  if (k <= (n / 2)) {
    long long x = n - 2 * k + 2;
    if ((x - 1) % 2 == 0) {
      x++;
    }
    for (long long i = 0; i < p; i++) {
      if ((v[i] >= x && v[i] % 2 == (x % 2)) || (k >= 1 && v[i] == n)) {
        cout << 'X';
      } else
        cout << '.';
    }
  } else {
    long long x = 2;
    long long k1 = ceil(n * 1.0 / 2);
    k -= k1;
    for (long long i = 0; i < p; i++) {
      if ((v[i] == n) || (v[i] % 2 == x % 2) ||
          (n % 2 == 0 && (n - 1 - v[i]) / 2 <= (k - 1)) ||
          (n % 2 == 1 && (n - 2 - v[i]) / 2 <= (k - 1))) {
        cout << 'X';
      } else
        cout << '.';
    }
  }
}
