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;
double const pi = 3.1415926535897932384626433832795;
int const inf = (int)1e9;
long long const inf64 = (long long)2e18;
const string name = "c";
long long n, k;
int q;
char solve(long long n, long long k, long long p) {
  long long now = 0;
  if (p & 1) now += n / 2;
  now += p / 2 + 1;
  if (now <= n - k)
    return '.';
  else
    return 'X';
}
int main() {
  cin >> n >> k >> q;
  for (int i = 0; i < (int)q; i++) {
    long long x;
    cin >> x;
    x--;
    if (n & 1) {
      if (k == 0)
        cout << '.';
      else if (x == n - 1)
        cout << 'X';
      else
        cout << solve(n - 1, k - 1, x);
    } else
      cout << solve(n, k, x);
  }
  cout << endl;
  return 0;
}
