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

import java.util.*;

public class C {
	private static Scanner in;

	public void run() {
		long n = in.nextLong();
		long x = in.nextLong();
		int p = in.nextInt();
		for (int t = 0; t < p; t++) {
			System.out.print(solve(n, x, in.nextLong() - 1) ? '.' : 'X');
		}
		System.out.println();
	}

	private boolean solve(long n, long x, long i) {
		long o = n - x;
		if (o <= x) {
			return (i % 2 == 0) && (i < 2 * o);
		}
		if (x == 0) {
			return true;
		}
		if (n % 2 == 1) {
			if (i == n - 1) {
				return false;
			}
			n--;
			x--;
		}
		if (x == 0) {
			return true;
		}
		return (i <= o - x) || (i % 2 == 0);
	}

	public static void main(String[] args) {
		Locale.setDefault(Locale.US);
		in = new Scanner(System.in);
		new C().run();
		in.close();
	}
}
