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() {
  long long n, k;
  int p;
  cin >> n >> k >> p;
  vector<long long> q(p + 1);
  for (int i = 1; i <= p; i++) cin >> q[i];
  if (n - k >= k) {
    long long limit = n - 2 * k;
    long long n1 = (n - k) / 2;
    if ((n - k) % 2 == 1) n1++;
    long long n2 = limit / 2 + k;
    if (n1 >= n2) {
      for (int i = 1; i <= p; i++) {
        if (q[i] <= n - k)
          cout << '.';
        else
          cout << 'X';
      }
    } else {
      long long limit = n - 2 * k;
      for (int i = 1; i <= p; i++) {
        if (q[i] <= limit) {
          cout << '.';
          continue;
        }
        if (q[i] % 2 == limit % 2)
          cout << 'X';
        else
          cout << '.';
      }
    }
  } else {
    for (int i = 1; i <= p; i++) {
      if (q[i] > 2 * (n - k)) {
        cout << 'X';
        continue;
      }
      if (q[i] % 2 == 0)
        cout << 'X';
      else
        cout << '.';
    }
  }
  cout << endl;
  return 0;
}
