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;
map<long long, long long> mp;
int type = -1;
long long LEN = -1, cnt = -1;
void solve(long long x, long long A) {
  if (x > A) {
    type = 1;
    cnt = A;
  }
  if (x == A) {
    type = 2;
    cnt = x;
  }
  if (x < A) {
    type = 3;
    cnt = (x - 1);
    if ((A - (x - 1)) % 2 == 1) {
      LEN = A - (x - 1);
    } else {
      cnt--;
      LEN = A - (x - 1) + 1;
    }
  }
}
long long n, k, p, pos;
int main() {
  cin >> n >> k >> p;
  solve(k, n - k);
  for (int i = 1; i <= p; i++) {
    cin >> pos;
    if (k == 0) {
      printf(".");
      continue;
    }
    if (k == n) {
      printf("X");
      continue;
    }
    if (k == 1) {
      if (n % 2 == 0) {
        if (pos == n)
          printf("X");
        else
          printf(".");
      } else {
        if (pos == n - 1)
          printf("X");
        else
          printf(".");
      }
      continue;
    }
    if (type == 2) {
      if (pos <= 2 * cnt - 1 && pos % 2 == 1) {
        printf(".");
      } else {
        printf("X");
      }
    }
    if (type == 1) {
      if (pos <= 2 * cnt - 1 && pos % 2 == 1) {
        printf(".");
      } else {
        printf("X");
      }
    }
    if (type == 3) {
      if (pos <= LEN) {
        printf(".");
        continue;
      }
      pos -= LEN;
      if (pos <= 2 * cnt - 1 && pos % 2 == 1) {
        printf(".");
      } else {
        printf("X");
      }
    }
  }
  printf("\n");
}
