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;
const int MAXN = 1000005;
long long n, k, p;
int main() {
  scanf("%lld%lld%d", &n, &k, &p);
  if (n & 1) n--, k--;
  for (int i = (0); i < (p); i++) {
    long long q;
    scanf("%lld", &q);
    if (k == -1)
      putchar('.');
    else if (q == n + 1)
      putchar('X');
    else if (k <= n / 2) {
      q = n - q;
      if (q >= 2 * k || (q & 1))
        putchar('.');
      else
        putchar('X');
    } else {
      q = n - q;
      if (k == n)
        putchar('X');
      else if (!(q & 1))
        putchar('X');
      else if (q <= (k - n / 2) * 2)
        putchar('X');
      else
        putchar('.');
    }
  }
}
