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 a[1010];
int main() {
  long long n, k, p;
  int q;
  scanf("%I64d%I64d%d", &n, &k, &q);
  p = n - k;
  for (int i = 0; i < q; i++) scanf("%d", a + i);
  if (k == 0) {
    for (int i = 0; i < q; i++) printf(".");
    return 0;
  }
  for (int i = 0; i < q; i++) {
    if (n % 2 == 0) {
      if (k <= p) {
        if (a[i] < n - 2 * k)
          printf(".");
        else if (a[i] % 2 == 1)
          printf(".");
        else
          printf("X");
      } else {
        if (a[i] > 2 * p)
          printf("X");
        else if (a[i] % 2 == 1)
          printf(".");
        else
          printf("X");
      }
    } else {
      if (p < k) {
        if (a[i] <= 2 * p) {
          if (a[i] % 2 == 1)
            printf(".");
          else
            printf("X");
        } else
          printf("X");
      } else {
        if (a[i] == n)
          printf("X");
        else if (a[i] <= p - k + 1)
          printf(".");
        else if (a[i] % 2 == 1)
          printf(".");
        else
          printf("X");
      }
    }
  }
  return 0;
}
