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 __gnu_cxx;
template <class key>
struct hashtemp {
  enum { bucket_size = 4, min_buckets = 8 };
  virtual size_t operator()(const key &p) const = 0;
};
using namespace std;
const long double M_PI = acos((long double)-1);
long double ZERO = 0;
const long double INF = 1 / ZERO, EPSILON = 1e-12;
int main() {
  long long n, k, p, x;
  cin >> n >> k >> p;
  while (p--) {
    cin >> x;
    int rx = n - x;
    if (k <= (1 + n) / 2) {
      if ((n - 2 * k) % 2 && k > 1) {
        if (rx == 0)
          cout << 'X';
        else {
          rx++;
          if (rx / 2 < k)
            cout << ((rx % 2) ? '.' : 'X');
          else
            cout << '.';
        }
      } else {
        if (rx / 2 < k)
          cout << ((rx % 2) ? '.' : 'X');
        else
          cout << '.';
      }
    } else {
      int m = k - n / 2;
      if (rx - 1 / 2 <= m)
        cout << 'X';
      else
        cout << ((rx % 2) ? '.' : 'X');
    }
  }
  cout << endl;
  return 0;
}
