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 = 1e5 + 10;
const int MOD = 1e9 + 7;
const int INF = 1e9;
long long n, k;
int p;
bool solve(long long x, long long n, long long k) {
  if (n % 2 == 1) {
    if (n == x) {
      return k > 0;
    }
    n--;
    k--;
  }
  if (x % 2 == 0) {
    if ((n - x) / 2 + 1 <= k) {
      return true;
    }
    return false;
  }
  k -= n / 2;
  if ((n - 1 - x) / 2 + 1 <= k) {
    return true;
  }
  return false;
}
int main() {
  cin >> n >> k >> p;
  while (p-- > 0) {
    long long x;
    cin >> x;
    cout << (solve(x, n, k) ? 'X' : '.');
  }
  cout << '\n';
  return 0;
}
