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 = 1000 * 101, INF = -1 * (1e+9);
long long n, k, p, x;
bool check(long long x) {
  if (k == -1) return 0;
  if (x == n + 1) return 1;
  if (k == 0) return 0;
  if (k <= n / 2) {
    if (x % 2 || x < n - (k - 1) * 2) return 0;
    return 1;
  }
  if (x % 2 == 0) return 1;
  long long q = k - n / 2;
  if (n - (q - 1) * 2 - 1 > x) return 0;
  return 1;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> k >> p;
  if (n % 2) {
    n--;
    k--;
  }
  for (int i = 0; i < p; i++) {
    cin >> x;
    if (check(x))
      cout << 'X';
    else
      cout << '.';
  }
}
