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;
  long long a[10000];
  int p;
  cin >> n >> k >> p;
  for (int i = 0; i < p; i++) {
    cin >> a[i];
  }
  if (!k) {
    for (int i = 0; i < p; i++) cout << '.';
  } else if (k == 1) {
    for (int i = 0; i < p; i++)
      if (a[i] == n)
        cout << 'X';
      else
        cout << '.';
  } else if (n <= 2 * k) {
    for (int i = 0; i < p; i++) {
      if (a[i] <= 2 * n - 2 * k) {
        if (a[i] % 2)
          cout << '.';
        else
          cout << 'X';
      } else
        cout << 'X';
    }
  } else {
    if (n % 2) {
      for (int i = 0; i < p; i++) {
        if (a[i] <= n - 2ll * (k - 1))
          cout << '.';
        else if (a[i] == n)
          cout << 'X';
        else {
          a[i] -= (n - 2ll * (k - 1));
          if (a[i] % 2)
            cout << 'X';
          else
            cout << '.';
        }
      }
    } else {
      for (int i = 0; i < p; i++) {
        a[i] -= 2 * k;
        if (a[i] <= 0)
          cout << '.';
        else if (a[i] % 2)
          cout << '.';
        else
          cout << 'X';
      }
    }
  }
  cout << endl;
  return 0;
}
