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;
int main(void) {
  long long q, n, k, p, R;
  int flag = 0, i;
  cin >> n;
  R = n;
  cin >> k;
  cin >> q;
  if (!k) flag = 1;
  if (n % 2) {
    n--;
    if (k) k--;
  }
  for (i = 0; i < q; i++) {
    cin >> p;
    if (flag) {
      cout << '.';
      continue;
    }
    if (p == R) {
      cout << 'X';
      continue;
    }
    if (k > n / 2) {
      if (p > 2 * (n - k))
        cout << "X";
      else {
        if (p % 2 == 1)
          cout << ".";
        else
          cout << "X";
      }
    } else {
      if ((n - p) % 2 == 0 && (n - p) < 2 * k)
        cout << "X";
      else
        cout << ".";
    }
  }
  return 0;
}
