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, p, t;
int main() {
  cin >> n >> k >> p;
  t = min(n - k, k);
  if (t % 2 != (n - k) % 2) t--;
  if (t == 0) t++;
  for (long long i = 0; i < p; i++) {
    long long a;
    cin >> a;
    if (k == n) {
      cout << 'X';
      continue;
    }
    if (k == 0) {
      cout << '.';
      continue;
    }
    if (a > n - k + t) {
      cout << 'X';
      continue;
    }
    if (a <= n - k - t + 1) {
      cout << '.';
      continue;
    }
    a -= n - k - t + 1;
    if (a % 2 == 1)
      cout << 'X';
    else
      cout << '.';
  }
  cout << endl;
  return 0;
}
