Problem: Once Bob decided to lay a parquet floor in his living room. The living room is of size n × m metres. Bob had planks of three types: a planks 1 × 2 meters, b planks 2 × 1 meters, and c planks 2 × 2 meters. Help Bob find out, if it is possible to parquet the living room with such a set of planks, and if it is possible, find one of the possible ways to do so. Bob doesn't have to use all the planks.

Input

The first input line contains 5 space-separated integer numbers n, m, a, b, c (1 ≤ n, m ≤ 100, 0 ≤ a, b, c ≤ 104), n and m — the living room dimensions, a, b and c — amount of planks 1 × 2, 2 × 1 и 2 × 2 respectively. It's not allowed to turn the planks.

Output

If it is not possible to parquet the room with such a set of planks, output IMPOSSIBLE. Otherwise output one of the possible ways to parquet the room — output n lines with m lower-case Latin letters each. Two squares with common sides should contain the same letters, if they belong to one and the same plank, and different letters otherwise. Different planks can be marked with one and the same letter (see examples). If the answer is not unique, output any.

Examples

Input

2 6 2 2 1


Output

aabcca
aabdda


Input

1 1 100 100 100


Output

IMPOSSIBLE


Input

4 4 10 10 10


Output

aabb
aabb
bbaa
bbaa

Solution (in JAVA):

Solution:
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.Scanner;

public class C {

	static int N = 0, M = 0, n = 0, m = 0, a = 0, b = 0, c = 0;
	static char[][] ans = new char[101][101];
	
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		PrintWriter pw = new PrintWriter(new OutputStreamWriter(System.out));
		N = in.nextInt();
		M = in.nextInt();
		a = in.nextInt();
		b = in.nextInt();
		c = in.nextInt();
		
		for (int i=1; i<=N; i++) {
			for (int j=1; j<=M; j++) {
				ans[i][j] = (char)('a' + (i+j)%4);
			}
		}
		n = N;
		m = M;
		if (!solve()) {
			pw.println("IMPOSSIBLE");
		}else{
			for (int i=1; i<=N; i++) {
				for (int j=1; j<=M; j++){
					pw.append(ans[i][j]);
				}
				pw.append("\n");
			}
		}
		pw.close();
	}
	
	static boolean solve() {
		if (((n*m) & 1) != 0) {
			return false;
		}		
		if ((m & 1) == 1) { // ��mΪ����, n�� 
			if (b < n/2) {
				return false;
			}
			b -= n/2;
			for (int i=1; i<=n; i+=2) { //��ÿһ�е����һ�а���b
				ans[i][M] = ans[i+1][M];
			}
			m--;
		}
		if ((n & 1) == 1) {
			if (a < m/2) {
				return false;
			}
			a -= m/2;
			for (int i=1; i<=m; i+=2) {
				ans[N][i] = ans[N][i+1];
			}
			n--;
		}
		if ((a & 1) == 1) a--;
		if ((b & 1) == 1) b--;
		
		if (m*n > 2*a + 2*b + 4*c) {
			return false;
		}
		
		for (int i=1; i<=n; i+=2) { // ��
			for (int j=1; j<=m; j+=2) { 
				if (a > 0) {
					ans[i][j] = ans[i][j+1];
					ans[i+1][j] = ans[i+1][j+1];
					a -= 2;
				}else if (b > 0) {
					ans[i][j] = ans[i+1][j];
					ans[i][j+1] = ans[i+1][j+1];
					b -= 2;
				}else{
					ans[i][j] = ans[i+1][j+1];
					ans[i+1][j] = ans[i+1][j+1];
					ans[i][j+1] = ans[i+1][j+1];
					c--;
				}
			}
		}
		return true;
	}
}