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 = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fll;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  long long n, k;
  int p;
  cin >> n >> k >> p;
  vector<long long> x(p);
  for (int i = 0; i < (int)x.size(); ++i) cin >> x[i];
  ;
  if (2 * k < n && (n - 2 * k) % 2) {
    for (int i = 0; i < p; ++i) {
      if (x[i] <= n - 2 * k + 1)
        cout << '.';
      else
        cout << ((n - x[i]) % 2 == 0 && x[i] != n ? '.' : 'X');
    }
  } else {
    for (int i = 0; i < p; ++i) {
      if (x[i] <= n - 2 * k)
        cout << '.';
      else
        cout << ((n - x[i]) % 2 ? '.' : 'X');
    }
  }
  cout << '\n';
  exit(0);
}
