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>
long long n, k;
inline bool solve(long long x) {
  if (k == 1) {
    return (x == n);
  } else if (n % 2 == 0) {
    if (k > n / 2) {
      if (x % 2 == 0) return 1;
      return x >= n + 1 - 2 * (k - n / 2);
    } else {
      if (x % 2 == 1) return 0;
      return x >= n - 2 * (k - 1);
    }
  } else {
    if (x == n) return 1;
    if (k > n / 2 + 1) {
      if (x % 2 == 0) return 1;
      return x >= n + 1 - 2 * (k - n / 2 - 1);
    } else {
      if (x % 2 == 1) return 0;
      return x >= n - 2 * (k - 1);
    }
  }
}
int main() {
  int p;
  scanf("%I64d%I64d%d", &n, &k, &p);
  while (p--) {
    long long x;
    scanf("%I64d", &x);
    printf("%c", solve(x) ? 'X' : '.');
  }
}
