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 MOD = 1000000007;
template <class T>
typename T::value_type arr_sum(const T& v, int n) {
  typename T::value_type sum = 0;
  for (int i = (0); i < (n); ++i) sum += v[i];
  return sum;
}
struct Sync_stdio {
  Sync_stdio() {
    cin.tie(NULL);
    ios_base::sync_with_stdio(false);
  }
} _sync_stdio;
long long get_num(long long x, long long n) {
  long long res = 0;
  if (n % 2 == 1 && x == n) {
    return 1;
  }
  if (x % 2 == 1) {
    res += n / 2;
  }
  res += n / 2 - (x - 1) / 2;
  if (n % 2 == 1) {
    ++res;
  }
  return res;
}
int main() {
  long long n, k, p;
  cin >> n >> k >> p;
  for (int i = (0); i < (p); ++i) {
    long long x;
    cin >> x;
    long long y = get_num(x, n);
    if (y > k) {
      cout << ".";
    } else {
      cout << "X";
    }
  }
}
