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>
#pragma GCC optimize("O2")
#pragma comment(linker, "/STACK:16777216")
using namespace std;
const int N = 1001;
long long ar[1005];
long long n, k, m;
int main() {
  while (cin >> n >> k >> m) {
    for (int i = 0; i < m; ++i) scanf("%I64d", &ar[i]);
    if (n & 1) {
      --n;
      --k;
      long long temp = n / 2;
      if (k <= temp) {
        for (int i = 0; i < m; ++i)
          if (ar[i] == n + 1) {
            putchar(k >= 0 ? 'X' : '.');
          } else if (ar[i] % 2 == 0 && ar[i] > n - 2 * k)
            putchar('X');
          else
            putchar('.');
      } else {
        for (int i = 0; i < m; ++i)
          if (ar[i] == n + 1) {
            putchar(k >= 0 ? 'X' : '.');
          } else if (ar[i] > n - k)
            putchar('X');
          else
            putchar('.');
      }
    } else {
      long long temp = n / 2;
      if (k <= temp) {
        for (int i = 0; i < m; ++i)
          if (ar[i] % 2 == 0 && ar[i] > n - 2 * k)
            putchar('X');
          else
            putchar('.');
      } else {
        for (int i = 0; i < m; ++i)
          if (ar[i] > n - k)
            putchar('X');
          else
            putchar('.');
      }
    }
    puts("");
  }
}
