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.14159265358979;
int inf = 1 << 30;
int main() {
  long long n, k, x;
  int p;
  cin >> n >> k >> p;
  for (int i = 0; i < (p); i++) {
    cin >> x;
    if (n - k > k) {
      if (n % 2 == 0) {
        long long m = n - (k * 2);
        if (x > m && x % 2 == 0)
          cout << 'X';
        else
          cout << '.';
      } else {
        if (x > (n - k))
          cout << 'X';
        else
          cout << '.';
      }
    }
    if (n - k == k) {
      if (x % 2 == 0)
        cout << 'X';
      else
        cout << '.';
    }
    if (n - k < k) {
      long long m = k - (n / 2);
      m = n - 2 * m;
      if (x > m || x % 2 == 0)
        cout << 'X';
      else
        cout << '.';
    }
  }
  return 0;
}
