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