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;
long long n, k;
int p;
int main() {
  scanf("%I64d%I64d", &n, &k);
  scanf("%d", &p);
  for (int i = 1; i <= p; i++) {
    long long x;
    scanf("%I64d", &x);
    if (!k) {
      printf(".");
      continue;
    }
    if (x == n) {
      printf("X");
      continue;
    }
    if (n % 2 == 0)
      if (k <= n / 2) {
        if (x % 2) {
          printf(".");
          continue;
        }
        if (x >= n - k * 2LL + 2LL)
          printf("X");
        else
          printf(".");
      } else {
        if (x % 2 == 0) {
          printf("X");
          continue;
        }
        long long tmp = k - n / 2;
        if (x >= n - tmp * 2LL + 1LL)
          printf("X");
        else
          printf(".");
      }
    else if (k <= n / 2 + 1LL) {
      if (x % 2) {
        printf(".");
        continue;
      }
      if (x >= n - k * 2LL + 3LL)
        printf("X");
      else
        printf(".");
    } else {
      if (x % 2 == 0) {
        printf("X");
        continue;
      }
      long long tmp = k - n / 2 - 1LL;
      if (x >= n - tmp * 2LL)
        printf("X");
      else
        printf(".");
    }
  }
  printf("\n");
  return 0;
}
