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 N = 5001;
const long long MOD = 1e9 + 7;
const double eps = 1e-9;
int main() {
  long long n, k, x;
  int p, f = 0;
  scanf("%lld%lld%d", &n, &k, &p);
  long long a = 0, b = n + 1;
  if (n & 1) {
    n--;
    if (k)
      k--, f = 2;
    else
      f = 1;
  }
  a = (k > n / 2 ? 0 : n - 2 * (k - 1));
  if (k >= n / 2) b = n - 1 - 2 * (k - n / 2 - 1);
  if (!k) a = n + 1, b = n + 1;
  while (p--) {
    scanf("%lld", &x);
    if (f && x == n + 1) {
      if (f == 2)
        printf("X");
      else
        printf(".");
    } else if (((x & 1) && x >= b) || (!(x & 1) && x >= a))
      printf("X");
    else
      printf(".");
  }
  puts("");
  return 0;
}
