#include <bits/stdc++.h>
#define int long long
using namespace std;
int n, m, k;
int a[10]; 
bool XoY[200][200];

int pow(int a, int b) {
	int ans = 1;
	while (b) {
		if (b & 1) ans *= a, b--;
		a *= a;
		b >>= 1;
	}
	return ans;
}

int f(int x) {
	int ans = 0;
	for (int i = 0; i <= k; i++) ans += pow(x, i) * a[i];
	if (ans > m) return 114514;
	else return ans;
}

signed main() {
	cin >> n >> m >> k;
	for (int i = 0; i <= k; i++) cin >> a[i];
	for (int i = 0; i < n; i++) if (f(i) != 114514) XoY[m - f(i)][i] = 1;
	for (int i = 1; i <= m; i++) {
		for (int j = 0; j < n; j++) {
			if (XoY[i][j]) cout << "*";
			else cout << ".";
		}
		cout << "\n";
	}
	return 0;
}