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, P, a[1005];
int main() {
  cin >> N >> K >> P;
  for (int i = 1; i <= P; ++i) cin >> a[i];
  if (K == 0) {
    for (int i = 1; i <= P; ++i) printf(".");
    puts("");
    exit(0);
  }
  if (K <= N / 2) {
    if ((N - K) % 2 != K % 2) {
      int ret = N - K * 2 + 1;
      for (int i = 1; i <= P; ++i) {
        if (a[i] == N)
          printf("X");
        else if (a[i] <= ret)
          printf(".");
        else
          printf("%c", (a[i] - ret) % 2 ? '.' : 'X');
      }
      puts("");
      exit(0);
    }
    long long ret = N - K * 2;
    for (int i = 1; i <= P; ++i) {
      if (a[i] <= ret)
        printf(".");
      else
        printf("%c", (a[i] - ret) % 2 ? '.' : 'X');
    }
    puts("");
    exit(0);
  } else {
    long long ret = (N - K) * 2;
    for (int i = 1; i <= P; ++i) {
      if (a[i] <= ret)
        printf("%c", (a[i] - ret) % 2 ? '.' : 'X');
      else
        printf("X");
    }
    puts("");
  }
  return 0;
}
