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 maxn = 2000;
int p;
int ans[maxn];
void solve(long long n, long long k, long long x) {
  if (k <= n / 2) {
    long long tp1 = n / 2;
    if (x % 2 == 0) {
      if (x >= 2 * (tp1 - k + 1) && x <= n)
        printf("X");
      else
        printf(".");
    } else
      printf(".");
  } else {
    if (x % 2 == 0)
      printf("X");
    else {
      long long tp1 = k - n / 2;
      if (x >= n - (2 * tp1 - 1) && x <= n)
        printf("X");
      else
        printf(".");
    }
  }
}
int main() {
  int i, j, p;
  long long x, n, k;
  while (scanf("%I64d%I64d%d", &n, &k, &p) != EOF) {
    while (p--) {
      scanf("%I64d", &x);
      if (k == 0) {
        printf(".");
        continue;
      }
      if (k == n) {
        printf("X");
        continue;
      }
      if (n & 1) {
        if (x == n)
          printf("X");
        else
          solve(n - 1, k - 1, x);
      } else
        solve(n, k, x);
    }
    printf("\n");
  }
  return 0;
}
