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 double pi = acos(-1.0);
const double eps = 1E-7;
const int inf = int(1e9) + 7;
char mp[2] = {'.', 'X'};
long long n, k;
int p;
int main() {
  scanf("%I64d%I64d%d", &n, &k, &p);
  long long zero = n - k;
  long long x;
  if (zero * 2 <= n) {
    for (int(i) = 0; (i) < (p); ++(i)) {
      scanf("%I64d", &x);
      if (x <= zero * 2)
        printf("%c", mp[(x + 1) % 2]);
      else
        printf("X");
    }
  } else {
    long long left = n - k * 2;
    if (left % 2) left++;
    for (int(i) = 0; (i) < (p); ++(i)) {
      scanf("%I64d", &x);
      if (x <= left)
        printf(".");
      else {
        if (x == n)
          printf("X");
        else {
          x -= left;
          printf("%c", mp[(x + 1) % 2]);
        }
      }
    }
  }
  return 0;
}
