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 = 10005;
long long n, k, p;
char query(long long q) {
  if (k > 0 && n == q)
    return 'X';
  else if (q % 2 == 1) {
    long long r = n / 2 - q / 2;
    long long nk = (n % 2 == 1) ? (k - 1 - n / 2) : (k - n / 2);
    if (r <= nk)
      return 'X';
    else
      return '.';
  } else {
    long long r = n / 2 - q / 2 + 1;
    long long nk = (n % 2 == 1) ? (k - 1) : k;
    if (r <= nk)
      return 'X';
    else
      return '.';
  }
}
int main() {
  cin >> n >> k >> p;
  for (int i = 0; i < p; ++i) {
    int q;
    cin >> q;
    cout << query(q);
  }
  cout << endl;
  return 0;
}
