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 type;
long long n, k, p;
int main() {
  scanf("%lld%lld%lld", &n, &k, &p);
  if (k == 0)
    type = 1;
  else if (k == n)
    type = 2;
  else if (n <= 2 * k) {
    if ((n - k) % 2 == 1)
      type = 3;
    else
      type = 4;
  } else {
    if (((k % 2) ^ ((n - k) % 2)) == 0)
      type = 5;
    else
      type = 6;
  }
  while (p--) {
    long long x;
    scanf("%lld", &x);
    if (type == 1)
      printf(".");
    else if (type == 2)
      printf("X");
    else if (type == 3) {
      if (x > 2 * n - 2 * k - 1)
        printf("X");
      else {
        if (x % 2 == 1)
          printf(".");
        else
          printf("X");
      }
    } else if (type == 4) {
      if (x > 2 * (n - k - 2) + 2)
        printf("X");
      else {
        if (x <= 2)
          printf(".");
        else {
          if (x % 2 == 1)
            printf("X");
          else
            printf(".");
        }
      }
    } else if (type == 5) {
      if (x <= n - 2 * k + 1)
        printf(".");
      else {
        long long tmp = x - (n - 2 * k + 1);
        if (tmp % 2 == 1)
          printf("X");
        else
          printf(".");
      }
    } else if (type == 6) {
      if (x <= n - 2 * k + 2)
        printf(".");
      else {
        long long tmp = x - (n - 2 * k + 2);
        if (x >= n - 2)
          printf("X");
        else {
          if (tmp % 2 == 1)
            printf("X");
          else
            printf(".");
        }
      }
    }
  }
  return 0;
}
