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, x, blank, div1, sum1, div2, sum2;
int p;
int main() {
  while (scanf("%I64d%I64d%d", &n, &k, &p) != EOF) {
    if (k == 0) {
      for (int i = 0; i < p; i++) {
        scanf("%I64d", &x);
        printf(".");
      }
      printf("\n");
    } else if (k == n) {
      for (int i = 0; i < p; i++) {
        scanf("%I64d", &x);
        printf("X");
      }
      printf("\n");
    } else {
      blank = n - k;
      div1 = 1;
      sum1 = min(blank, k) - 1;
      div2 = blank - sum1 * div1;
      sum2 = 1;
      if (div2 % 2 == 0)
        if (sum1 > 0) {
          sum1--;
          div2++;
        }
      if (div1 < div2) {
        swap(div1, div2);
        swap(sum1, sum2);
      }
      for (int i = 0; i < p; i++) {
        scanf("%I64d", &x);
        if ((div1 + 1) * sum1 >= x) {
          if (x % (div1 + 1) == 0)
            printf("X");
          else
            printf(".");
        } else if ((div1 + 1) * sum1 + (div2 + 1) * sum2 >= x) {
          if ((x - (div1 + 1) * sum1) % (div2 + 1) == 0)
            printf("X");
          else
            printf(".");
        } else
          printf("X");
      }
      printf("\n");
    }
  }
  return 0;
}
