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 long long MAX = 1000;
char ans[MAX];
long long query[MAX];
int main() {
  long long n, k, p;
  while (cin >> n >> k >> p) {
    for (long long i = 0; i < p; i++) {
      cin >> query[i];
      query[i]--;
    }
    if (2 * k < n) {
      if (n % 2 == 0 || k == 1) {
        for (long long i = 0; i < p; i++) {
          if (query[i] < n - 2 * k || query[i] % 2 == n % 2) {
            cout << ".";
          } else {
            cout << "X";
          }
        }
      } else {
        for (long long i = 0; i < p; i++) {
          if (query[i] < n - 2 * k + 2) {
            cout << ".";
          } else if (query[i] >= n - 2 * k + 4 && query[i] % 2 == n % 2) {
            cout << ".";
          } else {
            cout << "X";
          }
        }
      }
    } else {
      for (long long i = 0; i < p; i++) {
        if (query[i] < 2 * (n - k) && query[i] % 2 == 0) {
          cout << ".";
        } else {
          cout << "X";
        }
      }
    }
    cout << endl;
  }
}
