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;
long long mod = 1e9 + 7;
long long fast_exp(long long a, long long b) {
  if (b == 0)
    return 1;
  else {
    long long res = 1;
    res = fast_exp(a, b / 2);
    res = (res * res) % mod;
    if (b % 2 == 1) res = (res * a) % mod;
    return res;
  }
}
long long n, k;
char solve(long long x) {
  x = n + 1 - x;
  if (n % 2 == 1) {
    if (x == 1 && n > 0) return 'X';
    if (2 * (k - 1) >= x && x % 2 == 0) return 'X';
    if (2 * (k - n / 2 - 1) + 1 >= x && x % 2 == 1) return 'X';
    return '.';
  } else {
    if (2 * k > x && x % 2 == 1) return 'X';
    if (2 * (k - n / 2) >= x && x % 2 == 0) return 'X';
    return '.';
  }
}
int main() {
  long long p;
  cin >> n >> k >> p;
  vector<long long> quer;
  while (p--) {
    long long x;
    cin >> x;
    quer.push_back(x);
  }
  for (auto e : quer) cout << solve(e);
  cout << endl;
  return 0;
}
