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 = 120;
int n, m;
vector<int> adlist[maxn];
bool visited[maxn];
int vt[maxn];
int t = 0;
void input() {
  cin >> n >> m;
  for (int i = 0; i < m; i++) {
    int a, b;
    cin >> a >> b;
    a--;
    b--;
    adlist[a].push_back(b);
    adlist[b].push_back(a);
  }
}
int finds = 0;
void dfs(int root) {
  vt[root] = t++;
  visited[root] = true;
  for (int i = 0; i < adlist[root].size(); i++) {
    if (!visited[adlist[root][i]])
      dfs(adlist[root][i]);
    else {
      if (vt[adlist[root][i]] - vt[root] > 1) finds++;
    }
  }
}
int main() {
  long long n, k, p;
  cin >> n >> k >> p;
  for (int i = 0; i < p; i++) {
    long long g;
    cin >> g;
    if (k == 1) {
      if (g == n)
        cout << "X";
      else
        cout << ".";
    } else if (k < (n + 1) / 2) {
      int u = n - g + 1;
      if ((u) / 2 + 1 < k) {
        if ((n - g) % 2 == 0)
          cout << "X";
        else
          cout << ".";
      } else {
        if (g == (n - (2 * k - 2) + 1))
          cout << "X";
        else
          cout << ".";
      }
    } else {
      int u = k - (n + 1) / 2;
      if ((n - g + 1) / 2 <= u) {
        cout << "X";
      } else if ((n % 2 == 0 && g % 2ll == 0) || (n % 2 == 1 && g % 2ll == 1)) {
        cout << "X";
      } else
        cout << ".";
    }
  }
  cout << endl;
}
