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 N = 1111;
long long n, k, x[N];
int p;
int main() {
  cin >> n >> k >> p;
  for (int i = 1; i <= p; ++i) {
    cin >> x[i];
  }
  if (k == 0) {
    for (int i = 1; i <= p; ++i) {
      printf(".");
    }
    printf("\n");
    return 0;
  }
  long long last = n + 1;
  if (n & 1) {
    k -= 1;
    n -= 1;
    last = n + 1;
  }
  if (k == 0) {
    for (int i = 1; i <= p; ++i) {
      if (x[i] < last) {
        printf(".");
      } else {
        printf("X");
      }
    }
    printf("\n");
    return 0;
  }
  if (2 * k > n) {
    long long temp = 2 * k - n;
    n -= temp;
    last = n + 1;
  }
  long long first = n - 2 * (k - 1);
  for (int i = 1; i <= p; ++i) {
    if (x[i] < first) {
      printf(".");
    } else if (x[i] == first) {
      printf("X");
    } else if (x[i] >= last) {
      printf("X");
    } else {
      printf("%c", (x[i] - first) & 1 ? '.' : 'X');
    }
  }
  printf("\n");
  return 0;
}
