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;
const int INF = 1000 * 1000 * 1000;
const long long INF64 = 1000LL * 1000LL * 1000LL * 1000LL * 1000LL * 1000LL;
long long n, k;
int p;
void Load() { cin >> n >> k >> p; }
void Solve() {
  long long z, y, x, t;
  y = n - k;
  for (int i = 0; i < p; i++) {
    cin >> x;
    if (k == 0)
      cout << ".";
    else if (k == 1) {
      if (x == n)
        cout << "X";
      else
        cout << ".";
    } else {
      if (n - 2 * k <= 0) {
        if (x > 2 * y - 1)
          cout << "X";
        else if (x & 1)
          cout << ".";
        else
          cout << "X";
      } else {
        if (x == n) {
          cout << "X";
          continue;
        }
        if (!(n & 1)) {
          if (x <= n - 2 * k + 1)
            cout << ".";
          else {
            if (x & 1)
              cout << "X";
            else
              cout << ".";
          }
        } else {
          if (x <= n - 2 * k + 2)
            cout << ".";
          else {
            if (x & 1)
              cout << ".";
            else
              cout << "X";
          }
        }
      }
    }
  }
}
int main() {
  Load();
  Solve();
  return 0;
}
