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 long double PI = acos(-1.0);
int main() {
  long long n, k, p;
  cin >> n >> k >> p;
  long long enough;
  {
    long long l = 0, r = n;
    while (l < r) {
      long long m = (l + r) / 2;
      long long cur = m + (n - m) / 2;
      if (cur >= k)
        r = m;
      else
        l = m + 1;
    }
    enough = l;
  }
  long long best = k + (n - enough - (k - enough) * 2) / 2;
  if (enough == 0 && (n & 1)) best++;
  long long ans;
  {
    long long l = enough, r = k;
    while (l < r) {
      long long m = (l + r + 1) / 2;
      long long cur = m + (n - m) / 2;
      long long val = k + (n - m - (k - m) * 2) / 2;
      if (cur >= k && (val <= best))
        l = m;
      else
        r = m - 1;
    }
    ans = l;
  }
  long long t2 = n - ans;
  long long t1 = t2 - (k - ans) * 2;
  for (int i = 0; i < (int)(p); ++i) {
    long long X;
    cin >> X;
    if (X <= t1)
      cout << ".";
    else if (X <= t2 && (X % 2 == t1))
      cout << ".";
    else
      cout << "X";
  }
  cout << endl;
  return 0;
}
