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;
void XsliferX() {
  ios::sync_with_stdio(0);
  ios_base::sync_with_stdio(0);
  cin.tie(0), cout.tie(0);
}
long long f_p(long long x, int y) {
  if (y == 0)
    return 1;
  else if (y % 2 == 0)
    return f_p((x * x), y / 2);
  else
    return (x * f_p((x * x), y / 2));
}
int dx[9] = {1, -1, 0, 0, 0, 1, -1, 1, -1};
int dy[9] = {0, 0, 1, -1, 0, 1, -1, -1, 1};
long long n, k, p;
int main() {
  XsliferX();
  cin >> n >> k >> p;
  long long x;
  if (n % 2) {
    n--;
    for (int i = 0; i < p; i++) {
      cin >> x;
      long long r = n - x + 1;
      if (r == 0 && k == 0)
        cout << '.';
      else if (r % 2) {
        r = (r + 1) / 2;
        if (k >= r + 1)
          cout << 'X';
        else
          cout << '.';
      } else {
        r = r / 2;
        if ((k - (n / 2)) >= r)
          cout << 'X';
        else
          cout << '.';
      }
    }
  } else {
    for (int i = 0; i < p; i++) {
      cin >> x;
      long long r = n - x + 1;
      if (r % 2) {
        r = (r + 1) / 2;
        if (k >= r)
          cout << 'X';
        else
          cout << '.';
      } else {
        r = r / 2;
        if (k - n / 2 >= r)
          cout << 'X';
        else
          cout << '.';
      }
    }
  }
  return 0;
}
