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;
int p;
int main() {
  cin >> n >> k >> p;
  if (k == 0) {
    for (int i = 0; i < p; i++) printf(".");
  } else if (k == 1) {
    for (int i = 0; i < p; i++) {
      long long x;
      cin >> x;
      x--;
      if (x == n - 1)
        printf("X");
      else
        printf(".");
    }
  } else if (2 * k < n) {
    long long lastgroup = n - 2 * (k - 1);
    long long alllast;
    if (lastgroup % 2 == 0) {
      alllast = 0;
    } else {
      alllast = 1;
      lastgroup += 1;
    }
    for (int i = 0; i < p; i++) {
      long long x;
      cin >> x;
      x--;
      if (x >= n - 1 - alllast + 1) {
        printf("X");
      } else {
        if (x < lastgroup - 1) {
          printf(".");
        } else if (x == lastgroup - 1) {
          printf("X");
        } else {
          x = n - 1 - alllast - x;
          if (x % 2 == 0)
            printf("X");
          else
            printf(".");
        }
      }
    }
  } else {
    long long alllast;
    if (n % 2 == 0)
      alllast = 0;
    else
      alllast = 1;
    long long ost = k - n / 2 - alllast;
    alllast += max(0ll, 2 * ost);
    for (int i = 0; i < p; i++) {
      long long x;
      cin >> x;
      x--;
      if (x >= n - 1 - alllast + 1) {
        printf("X");
      } else {
        x = n - 1 - alllast - x;
        if (x % 2 == 0)
          printf("X");
        else
          printf(".");
      }
    }
  }
}
