public void eg(int j, int k, int l, int i1, int j1) {
		if (j < uk) {
			l -= uk - j;
			j = uk;
		}
		if (k < sk) {
			i1 -= sk - k;
			k = sk;
		}
		if (j + l > vk)
			l = vk - j;
		if (k + i1 > tk)
			i1 = tk - k;
		int k1 = xj - l;
		byte byte0 = 1;
		if (wk) {
			byte0 = 2;
			k1 += xj;
			if ((k & 1) != 0) {
				k++;
				i1--;
			}
		}
		int l1 = j + k * xj;
		for (int i2 = -i1; i2 < 0; i2 += byte0) {
			for (int j2 = -l; j2 < 0; j2++)
				dk[l1++] = j1;

			l1 += k1;
		}

	}