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 INF = (int)1e9;
const long long LINF = (long long)1e18;
long long n, k;
int p;
char ans(long long q) {
  if (k == 0) return '.';
  if (k <= (n + n % 2) / 2) {
    if (q == n) return 'X';
    if ((q >= (n - 2 * (k - 1))) && q % 2 == 0)
      return 'X';
    else
      return '.';
  } else {
    if (q == n) return 'X';
    if (q % 2 == 0 || (q >= 2 * (n - k)))
      return 'X';
    else
      return '.';
  }
}
int main() {
  cin >> n >> k >> p;
  for (int i = 0; i < p; ++i) {
    long long temp;
    cin >> temp;
    cout << ans(temp);
  }
  return 0;
}
