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>
const int magicconst = 73743071;
using namespace std;
int main() {
  long long n, k;
  int p;
  scanf("%I64d%I64d%d", &n, &k, &p);
  if (k == 1) {
    for (int i = 0; i < (int)(p); ++i) {
      long long q;
      scanf("%I64d", &q);
      printf("%c", "X."[q < n]);
    }
    return 0;
  }
  long long cnt = min(n - k, k - 1);
  n -= 2 * cnt;
  k -= cnt;
  if (k == 1) {
    if (n == 1) {
      for (int i = 0; i < (int)(p); ++i) {
        long long q;
        scanf("%I64d", &q);
        if (q <= 2 * cnt)
          printf("%c", "X."[q & 1]);
        else
          printf("X");
      }
    } else if (n & 1) {
      for (int i = 0; i < (int)(p); ++i) {
        long long q;
        scanf("%I64d", &q);
        if (q <= n)
          printf(".");
        else if (q == n + 1 || q == n + 2 * cnt)
          printf("X");
        else
          printf("%c", ".X"[(q - n) & 1]);
      }
    } else {
      for (int i = 0; i < (int)(p); ++i) {
        long long q;
        scanf("%I64d", &q);
        if (q < n)
          printf(".");
        else if (q == n)
          printf("X");
        else
          printf("%c", "X."[(q - n) & 1]);
      }
    }
  } else {
    for (int i = 0; i < (int)(p); ++i) {
      long long q;
      scanf("%I64d", &q);
      if (q <= 2 * cnt)
        printf("%c", "X."[q & 1]);
      else
        printf("X");
    }
  }
  return 0;
}
