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;
list<int> e[101];
vector<bool> vis(101, 0);
void dfs(int root, int node) {
  if (vis[node]) return;
  vis[node] = true;
  for (auto val : e[node]) {
    dfs(node, val);
  }
}
int main() {
  long long n, k;
  int p;
  cin >> n >> k >> p;
  for (int i = 0; i < p; i++) {
    long long x;
    cin >> x;
    if (n % 2 == 0) {
      if (x % 2 == 0) {
        if ((n - x) / 2 + 1 <= k)
          cout << "X";
        else
          cout << ".";
      } else {
        if (k + k <= n)
          cout << ".";
        else if ((n - x - 1) / 2 < k - n / 2)
          cout << "X";
        else
          cout << ".";
      }
    } else {
      if (n - k + 1 <= x)
        cout << "X";
      else
        cout << ".";
    }
  }
  return 0;
}
