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 n, k, a[1111];
int p;
int main() {
  if (0) {
    freopen("aaa.inp", "r", stdin);
    freopen("aaa.out", "w", stdout);
  };
  scanf("%I64d%I64d%d", &n, &k, &p);
  for (int i = 0; i < p; i++) scanf("%I64d", &a[i]);
  long long dt = k - n + k;
  if (dt < 0) dt = 0;
  n -= dt;
  k -= dt;
  if (n % 2 == 1 && k >= 1) n--, k--;
  for (int i = 0; i < p; i++) {
    long long c = a[i];
    if (c > n)
      printf("X");
    else if (c > n - k - k)
      if (c % 2 == 0)
        printf("X");
      else
        printf(".");
    else
      printf(".");
  }
  return 0;
};
