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;
pair<int, int> a[300100];
pair<int, int> sum[300100];
pair<int, int> ans[300100];
pair<pair<int, int>, int> q[300100];
int main() {
  long long n, k;
  cin >> n >> k;
  int p;
  cin >> p;
  long long left = n - k;
  if (left <= k) {
    long long v = ((left < k) ? (left) : (k));
    for (int i = (0); i < (p); ++i) {
      long long pos;
      cin >> pos;
      pos--;
      if (pos < 2 * v) {
        if (pos & 1)
          printf("X");
        else
          printf(".");
      } else
        printf("X");
    }
  } else {
    long long now = n - k - k;
    for (int i = (0); i < (p); ++i) {
      long long pos;
      cin >> pos;
      pos--;
      if (k == 1) {
        if (pos == n - 1)
          printf("X");
        else
          printf(".");
      } else if (now & 1) {
        if (pos < now + 2)
          printf(".");
        else if (pos == n - 1)
          printf("X");
        else {
          long long c = pos - now - 2;
          if (c & 1)
            printf(".");
          else
            printf("X");
        }
      } else {
        if (pos < now)
          printf(".");
        else {
          long long c = pos - now;
          if (c & 1)
            printf("X");
          else
            printf(".");
        }
      }
    }
  }
  printf("\n");
  return 0;
}
