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 comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
const int MAX = 2e3 + 10;
const int MOD = 1e9 + 7;
using namespace std;
long long n, p, k1, k2;
int main() {
  cin >> n >> k1 >> p;
  k2 = n - k1;
  long long pos;
  if (k1 == 1) {
    while (p--) {
      cin >> pos;
      if (pos <= k2)
        cout << '.';
      else
        cout << 'X';
    }
  } else if (k1 >= k2) {
    while (p--) {
      cin >> pos;
      if (pos <= 2 * k2) {
        if (pos & 1)
          cout << '.';
        else
          cout << 'X';
      } else
        cout << 'X';
    }
  } else {
    long long rem = k2 - k1;
    if (rem & 1) rem++;
    while (p--) {
      cin >> pos;
      if (pos <= rem)
        cout << '.';
      else if (pos == n)
        cout << 'X';
      else {
        if ((pos - rem) & 1)
          cout << '.';
        else
          cout << 'X';
      }
    }
  }
  cout << endl;
}
