public void ag(int j, int k, int l, int i1, int j1, int k1) {
		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 l1 = 256 - k1;
		int i2 = (j1 >> 16 & 0xff) * k1;
		int j2 = (j1 >> 8 & 0xff) * k1;
		int k2 = (j1 & 0xff) * k1;
		int k3 = xj - l;
		byte byte0 = 1;
		if (wk) {
			byte0 = 2;
			k3 += xj;
			if ((k & 1) != 0) {
				k++;
				i1--;
			}
		}
		int l3 = j + k * xj;
		for (int i4 = 0; i4 < i1; i4 += byte0) {
			for (int j4 = -l; j4 < 0; j4++) {
				int l2 = (dk[l3] >> 16 & 0xff) * l1;
				int i3 = (dk[l3] >> 8 & 0xff) * l1;
				int j3 = (dk[l3] & 0xff) * l1;
				int k4 = ((i2 + l2 >> 8) << 16) + ((j2 + i3 >> 8) << 8) + (k2 + j3 >> 8);
				dk[l3++] = k4;
			}

			l3 += k3;
		}

	}