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 INF = 0x3f3f3f3f;
long long n, k, x;
int q;
int main() {
  while (~scanf("%lld %lld %d", &n, &k, &q)) {
    long long tmp = max(k - (n + 1) / 2, 0LL);
    while (q--) {
      scanf("%lld", &x);
      if (k == 0)
        printf(".");
      else {
        if (n % 2 && x == n)
          printf("X");
        else {
          long long tmp1 = n - 2 * (k - n % 2) - n % 2;
          long long tmp2 = n - n % 2 - 2 * tmp;
          if (x <= tmp1 + 1)
            printf(".");
          else if (tmp1 >= 0) {
            if ((x - tmp1) % 2 == 0)
              printf("X");
            else
              printf(".");
          } else if (x > tmp2)
            printf("X");
          else {
            if (x % 2 == 1)
              printf(".");
            else
              printf("X");
          }
        }
      }
    }
    printf("\n");
  }
  return 0;
}
