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>
#pragma GCC optimize("Ofast")
using namespace std;
clock_t clk = clock();
long long int i, j, k;
void solve(void);
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ;
  int t = 1;
  while (t--) solve();
  return 0;
}
void solve() {
  long long int n, k, q;
  cin >> n >> k >> q;
  if (k == 1) {
    while (q--) {
      long long int x;
      cin >> x;
      if (x < n)
        cout << '.';
      else
        cout << 'X';
    }
    cout << '\n';
    return;
  }
  if (2 * k >= n)
    while (q--) {
      long long int x;
      cin >> x;
      if (x <= 2 * (n - k)) {
        if (x & 1)
          cout << '.';
        else
          cout << 'X';
      } else
        cout << 'X';
    }
  else {
    if ((n - k) & 1)
      while (q--) {
        long long int x;
        cin >> x;
        if (x <= n - k)
          cout << '.';
        else
          cout << 'X';
      }
    else
      while (q--) {
        long long int x;
        cin >> x;
        if (x <= n - k - 1)
          cout << '.';
        else if (x == n - k)
          cout << 'X';
        else if (x == n - k + 1)
          cout << '.';
        else
          cout << 'X';
      }
  }
  cout << '\n';
}
