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 N = (int)1e3 + 4;
int main() {
  long long int n, i, j, k, p, x, l, cnte, so, se;
  cin >> n >> k >> p;
  if (k == 0) {
    for (int i = 0; i < p; i++) {
      cin >> x;
      cout << ".";
    }
    return 0;
  }
  if (n % 2 == 0) {
    for (int i = 0; i < p; i++) {
      cin >> x;
      cnte = min(k, n / 2);
      se = n + (cnte - 1) * (-2);
      so = (n + 1) - 2 * (k - n / 2);
      if (so == 1) {
        cout << "X";
        continue;
      }
      if (x >= so) {
        cout << "X";
        continue;
      }
      if (x < so) {
        if (x < se) {
          cout << ".";
        } else {
          if (x % 2 == 0)
            cout << "X";
          else
            cout << ".";
        }
      }
    }
  }
  if (n % 2 == 1) {
    if (k == 1) {
      for (int i = 0; i < p; i++) {
        cin >> x;
        if (x != n) {
          cout << ".";
        } else
          cout << "X";
      }
      return 0;
    } else {
      k--;
      n--;
      for (int i = 0; i < p; i++) {
        cin >> x;
        if (x == (n + 1)) {
          cout << "X";
          continue;
        }
        cnte = min(k, n / 2);
        se = n + (cnte - 1) * (-2);
        so = (n + 1) - 2 * (k - n / 2);
        if (so == 1) {
          cout << "X";
          continue;
        }
        if (x >= so) {
          cout << "X";
          continue;
        }
        if (x < so) {
          if (x < se) {
            cout << ".";
          } else {
            if (x % 2 == 0)
              cout << "X";
            else
              cout << ".";
          }
        }
      }
    }
  }
  return 0;
}
