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;
#pragma comment(linker, "/STACK:255000000")
bool firstout = 1;
template <class T>
void minn(T &a, T b) {
  if (b < a) a = b;
}
template <class T>
void maxx(T &a, T b) {
  if (a < b) a = b;
}
long long n, m;
int A[1012];
int main() {
  int k;
  char c;
  int a, d;
  int ts;
  for (ts = 1; scanf("%"
                     "I64d",
                     &(n)) > 0;
       ++ts) {
    scanf(
        "%"
        "I64d",
        &(m));
    int q;
    long long i;
    scanf(
        "%"
        "d",
        &(q));
    for (k = (0); k < (q); ++k) {
      scanf(
          "%"
          "I64d",
          &(i));
      --i;
      int res;
      if (2 * m <= n) {
        if (n & 1) {
          if (i < n - (2 * m - 1))
            res = 0;
          else if (i == n - 1)
            res = 1;
          else
            res = (n - i - 1) & 1;
        } else {
          if (i < n - 2 * m)
            res = 0;
          else
            res = (i - (n - 2 * m)) & 1;
        }
      } else {
        if (i < 2 * (n - m))
          res = (i & 1);
        else
          res = 1;
      }
      printf(
          "%"
          "c",
          (res ? 'X' : '.'));
    }
    printf("\n"), firstout = 1;
  }
  return 0;
}
