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, first, k0, k1;
bool req(long long i) {
  if (!k) {
    return false;
  } else if (k == 1) {
    return (i == n);
  } else if (k == n) {
    return true;
  } else {
    if (i <= first + 1) {
      return (i == first + 1);
    }
    i -= first + 1;
    if (i <= k1 * 2) {
      return !(i % 2);
    }
    return true;
  }
}
int main(void) {
  int i, p;
  cin >> n >> k >> p;
  n -= k;
  first = max(1ll, n % 2 ? n - ((k - 1) & -2) : n - (k & -2) + 1);
  k0 = max(k - n, n % 2 ? (k + 1) % 2 : k % 2);
  k1 = n - first;
  n += k;
  for (i = 0; i < p; ++i) {
    long long x;
    cin >> x;
    cout << (req(x) ? 'X' : '.');
  }
  cout << "\n";
  return 0;
}
