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;
long long n, k, p;
void solve(long long x) {
  if (k + k == n) {
    if (x % 2LL == 0LL)
      cout << "X";
    else
      cout << ".";
  } else if (k + k < n) {
    if (n % 2LL == 0LL) {
      long long length = n - 2LL * (k - 1LL);
      if (x < length)
        cout << ".";
      else if (x == length)
        cout << "X";
      else if ((x - length) % 2LL == 0LL)
        cout << "X";
      else
        cout << ".";
    } else {
      long long length = n - 2LL * (k - 1LL);
      if (length == n) {
        if (x < length)
          cout << ".";
        else
          cout << "X";
      } else {
        length++;
        if (x < length)
          cout << ".";
        else if (x == length)
          cout << "X";
        else if (x == n)
          cout << "X";
        else if ((x - length) % 2LL == 0LL)
          cout << "X";
        else
          cout << ".";
      }
    }
  } else {
    long long have = n - k;
    if (x > have + have)
      cout << "X";
    else {
      if (x % 2LL == 0LL)
        cout << "X";
      else
        cout << ".";
    }
  }
}
long long a[1100];
int main() {
  cin >> n >> k >> p;
  for (int i = 1; i <= p; i++) cin >> a[i];
  for (int i = 1; i <= p; i++) solve(a[i]);
  printf("\n");
  return 0;
}
