public void mg(int j, int k, int l, int i1, int j1, int k1) {
		if (j < uk) {
			l -= uk - j;
			j = uk;
		}
		if (j + l > vk)
			l = vk - j;
		int l1 = k1 >> 16 & 0xff;
		int i2 = k1 >> 8 & 0xff;
		int j2 = k1 & 0xff;
		int k2 = j1 >> 16 & 0xff;
		int l2 = j1 >> 8 & 0xff;
		int i3 = j1 & 0xff;
		int j3 = xj - l;
		byte byte0 = 1;
		if (wk) {
			byte0 = 2;
			j3 += xj;
			if ((k & 1) != 0) {
				k++;
				i1--;
			}
		}
		int k3 = j + k * xj;
		for (int l3 = 0; l3 < i1; l3 += byte0)
			if (l3 + k >= sk && l3 + k < tk) {
				int i4 = ((l1 * l3 + k2 * (i1 - l3)) / i1 << 16) + ((i2 * l3 + l2 * (i1 - l3)) / i1 << 8)
						+ (j2 * l3 + i3 * (i1 - l3)) / i1;
				for (int j4 = -l; j4 < 0; j4++)
					dk[k3++] = i4;

				k3 += j3;
			} else {
				k3 += xj;
			}

	}