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 = 1000 * 1000 * 1000;
const long long linf = 1000000000000000000LL;
const double eps = 1e-9;
void prepare() {}
long long n, k, x;
int p;
bool solve() {
  cin >> n >> k >> p;
  for (int i = 0; i < p; i++) {
    cin >> x;
    if (k == 0)
      cout << ".";
    else if (k <= n - k) {
      if ((n - 2 * k + 1) % 2 == 0 && (n - 2 * k + 1 != (n - k))) {
        long long np = n - 2 * k + 1;
        if (x == np || x == n - 2) {
          cout << ".";
          continue;
        }
        if (x == n) {
          cout << "X";
          continue;
        }
        x++;
      }
      if (x <= n - 2 * k)
        cout << ".";
      else {
        x -= (n - 2 * k);
        if (x & 1)
          cout << ".";
        else
          cout << "X";
      }
    } else {
      if (x <= 2 * (n - k)) {
        if (x & 1)
          cout << ".";
        else
          cout << "X";
      } else
        cout << "X";
    }
  }
  cout << endl;
  return false;
}
int main() {
  prepare();
  while (solve())
    ;
  return 0;
}
