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 = 5001;
long long n, k, p;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> k >> p;
  if (n % 2 == 0) {
    while (p--) {
      long long pos;
      cin >> pos;
      if (pos % 2 == 0) {
        long long order = pos / 2;
        long long bigo = n / 2;
        if (bigo - order + 1 <= k)
          cout << 'X';
        else
          cout << '.';
      } else {
        long long numeven = n / 2;
        long long bigo = n / 2;
        long long order = (pos + 1) / 2;
        if (k - numeven >= bigo - order + 1)
          cout << 'X';
        else
          cout << '.';
      }
    }
  } else {
    while (p--) {
      long long pos;
      cin >> pos;
      if (pos % 2 == 0) {
        long long order = pos / 2;
        long long bigo = n / 2;
        if (bigo - order + 1 <= k - 1)
          cout << 'X';
        else
          cout << '.';
      } else {
        long long numeven = n / 2 + 1;
        long long bigo = n / 2;
        long long order = (pos + 1) / 2;
        if (pos == n) {
          if (k) {
            cout << 'X';
          } else
            cout << '.';
          continue;
        }
        if (k - numeven >= bigo - order + 1)
          cout << 'X';
        else
          cout << '.';
      }
    }
  }
  return 0;
}
