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() {
  unsigned long long int n, k, p, c;
  cin >> n >> k >> p;
  if (n % 2 == 0) {
    if (k > n / 2) {
      unsigned long long int u = 2 * k - n;
      unsigned long long int r = 2 * n - 2 * k;
      r = r * 2;
      for (long i = 1; i <= p; i++) {
        cin >> c;
        if (c <= r) {
          if (c % 2 == 0)
            cout << 'X';
          else
            cout << '.';
        } else {
          if (c % 2 != 0)
            cout << 'X';
          else
            cout << '.';
        }
      }
      cout << endl;
      return 0;
    } else {
      unsigned long long int h = (k - 1) * 2;
      unsigned long long int f = n - h;
      for (long i = 1; i <= p; i++) {
        cin >> c;
        if (c < f) cout << '.';
        if (c >= f && c % 2 == 0) cout << 'X';
        if (c >= f && c % 2 != 0) cout << '.';
      }
      cout << endl;
      return 0;
    }
  }
  unsigned long long int g = (n + 1) / 2;
  if (k <= g) {
    if (k == 1) {
      for (long i = 1; i <= p; i++) {
        cin >> c;
        if (c == n)
          cout << 'X';
        else
          cout << '.';
      }
      cout << endl;
      return 0;
    }
    if (k == 0) {
      for (long i = 1; i <= p; i++) {
        cin >> c;
        cout << '.';
      }
      cout << endl;
      return 0;
    }
    unsigned long long int u = (k - 2) * 2;
    unsigned long long int f = n - u - 1;
    for (long i = 1; i <= p; i++) {
      cin >> c;
      if (c < f) cout << '.';
      if (c >= f && c % 2 == 0 && c < n) cout << 'X';
      if (c >= f && c % 2 != 0 && c < n) cout << '.';
      if (c == n) cout << 'X';
    }
    cout << endl;
    return 0;
  }
  unsigned long long int u = 2 * k - n;
  unsigned long long int h = n - u;
  h = h;
  for (long i = 1; i <= p; i++) {
    cin >> c;
    if (c <= h) {
      if (c % 2 == 0)
        cout << 'X';
      else
        cout << '.';
    } else {
      cout << 'X';
    }
  }
  cout << endl;
}
