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, pos;
int p;
long long need(long long pos) {
  long long res = 0, nn = n;
  if (nn % 2 == 1) {
    res++;
    nn--;
  }
  if (pos == n) return 1;
  if (pos % 2 == 0) return res + (nn - pos) / 2 + 1;
  return res + nn / 2 + (nn - pos) / 2 + 1;
}
int main() {
  scanf("%I64d%I64d%d", &n, &k, &p);
  for (int i = 0; i < p; i++) {
    scanf("%I64d", &pos);
    if (need(pos) > k)
      printf(".");
    else
      printf("X");
  }
  printf("\n");
  return 0;
}
