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;
  int p;
  long long q[1010];
  cin >> n >> k >> p;
  for (int i = 0; i < p; i++) cin >> q[i];
  if (n >= 2 * k - 1) {
    for (int i = 0; i < p; i++) {
      long long f = n - (2 * k - 1);
      if (q[i] <= f) {
        cout << ".";
        continue;
      }
      if (f % 2 == 1) {
        if ((q[i] - f) % 2)
          cout << "X";
        else
          cout << ".";
      } else {
        if ((q[i] - f) % 2 == 0 || q[i] == n)
          cout << "X";
        else
          cout << ".";
      }
    }
  } else {
    for (int i = 0; i < p; i++) {
      long long x = (n - k) * 2;
      if (q[i] <= x) {
        if (q[i] % 2)
          cout << ".";
        else
          cout << "X";
      } else
        cout << "X";
    }
  }
  puts("");
  return 0;
}
