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 int inf = 1 << 30;
const long long linf = 1LL << 60;
int main() {
  long long n, k, p;
  cin >> n >> k >> p;
  for (int i = 0; i < p; ++i) {
    long long x;
    cin >> x;
    if (k == 0) {
      putchar('.');
      continue;
    }
    if (n % 2 == 1 && x == n) {
      if (x == n - 1 || x == n || (x == n - 3 && k == 3))
        putchar('X');
      else
        putchar('.');
    } else {
      x = n - x;
      if (n % 2 == 0) {
        if (x % 2 == 0) {
          if (x / 2 + 1 <= k)
            putchar('X');
          else
            putchar('.');
        } else {
          if (k > (n / 2) && x / 2 <= k - (n / 2) - 1)
            putchar('X');
          else
            putchar('.');
        }
      } else {
        if (x % 2 == 1) {
          if (x / 2 + 2 <= k)
            putchar('X');
          else
            putchar('.');
        } else {
          if (k > (n / 2) && x / 2 <= k - (n / 2) - 1)
            putchar('X');
          else
            putchar('.');
        }
      }
    }
  }
  putchar('\n');
  return 0;
}
