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, f, fk, p;
  int i, t;
  scanf("%I64d%I64d%d", &n, &k, &t);
  f = n - k;
  int fl = k;
  k = min(f, k);
  if (((f + k) % 2ll) == 1ll) k--;
  fk = f + k - (2ll * (k - 1ll));
  for (i = 0; i < t; i++) {
    if (!k) {
      printf(".");
      continue;
    }
    scanf("%I64d", &p);
    if (p < fk && fk <= f + k) {
      printf(".");
      continue;
    }
    if (p <= f + k) {
      if (((fk % (2ll)) == (p % (2ll))) && fk <= f + k)
        printf("X");
      else
        printf(".");
    } else
      printf("X");
  }
  printf("\n");
  return 0;
}
