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, pos, xxx;
int p;
void work() {
  long long rem = n - k, ned = k << 1;
  if (ned <= n) {
    if (k && (rem & 1) != (k & 1)) {
      n -= 1LL;
      k -= 1LL;
      ned = k << 1;
    }
    pos = n - ned + 1LL;
    xxx = n + 1LL;
  } else {
    ned = rem << 1;
    xxx = ned + 1LL;
    pos = 1LL;
  }
  for (int i = 0; i < p; i++) {
    long long x;
    cin >> x;
    if (x >= xxx || (x >= pos && ((x - pos) & 1)))
      printf("X");
    else
      printf(".");
  }
}
int main() {
  cin >> n >> k >> p;
  work();
  return 0;
}
