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;
long long N, K, P;
long long evenHave, oddHave;
string s;
bool have(long long pos) {
  long long p;
  if (pos > N) return true;
  if (pos % 2 == 0) {
    p = pos / 2;
    if (N / 2 + 1 - p <= evenHave) return true;
  } else {
    p = (pos + 1) / 2;
    if (N / 2 + 1 - p <= oddHave) return true;
  }
  return false;
}
int main() {
  ios ::sync_with_stdio(false);
  while (cin >> N >> K >> P) {
    s = "";
    if (K == 0) {
      for (int i = 1; i <= P; i++) {
        long long pos;
        cin >> pos;
      }
      for (int i = 1; i <= P; i++) s += ".";
      cout << s << endl;
    } else {
      if (N % 2 == 1) {
        N--;
        K--;
      }
      evenHave = K;
      oddHave = 0;
      if (evenHave > N / 2) {
        oddHave = evenHave - N / 2;
        evenHave = N / 2;
      }
      for (int i = 1; i <= P; i++) {
        long long pos;
        cin >> pos;
        if (have(pos))
          s += "X";
        else
          s += ".";
      }
      cout << s << endl;
    }
  }
  return 0;
}
