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;
long long n, k, p, x[1010];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> n >> k >> p;
  for (int i = 0; i < p; i++) {
    cin >> x[i];
  }
  long long even = n / 2, odd = n - even;
  if (odd < k) {
    for (int i = 0; i < p; i++) {
      if (x[i] >= n - k + 1) {
        cout << 'X';
      } else {
        cout << '.';
      }
    }
  } else if (n % 2 == 1) {
    for (int i = 0; i < p; i++) {
      if ((x[i] % 2 == 0 && ceil((n - x[i] + 1) / 2.0) <= k - 1) || x[i] == n) {
        cout << 'X';
      } else {
        cout << '.';
      }
    }
  } else {
    for (int i = 0; i < p; i++) {
      if (x[i] % 2 == 0 && ceil((n - x[i] + 1) / 2.0) <= k) {
        cout << 'X';
      } else {
        cout << '.';
      }
    }
  }
}
