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;
int main() {
  long long n, k, p;
  cin >> n >> k >> p;
  while (p--) {
    long long x;
    cin >> x;
    if (k == 0) {
      cout << '.';
      continue;
    } else {
      if (n % 2) {
        if (x == n)
          cout << 'X';
        else {
          long long num_even = min(k - 1, (n - 1) / 2);
          long long num_odd = (k - 1) - num_even;
          if (x % 2 == 0) {
            long long dist = (n - 1 - x) / 2;
            if (dist + 1 <= num_even) {
              cout << 'X';
            } else {
              cout << '.';
            }
          } else {
            long long dist = (n - 2 - x) / 2;
            if (dist + 1 <= num_odd) {
              cout << 'X';
            } else {
              cout << '.';
            }
          }
        }
      } else {
        long long num_even = min(k, (n) / 2);
        long long num_odd = (k)-num_even;
        if (x % 2 == 0) {
          long long dist = (n - x) / 2;
          if (dist + 1 <= num_even) {
            cout << 'X';
          } else {
            cout << '.';
          }
        } else {
          long long dist = (n - 1 - x) / 2;
          if (dist + 1 <= num_odd) {
            cout << 'X';
          } else {
            cout << '.';
          }
        }
      }
    }
  }
  return 0;
}
