public void xi(int l, int i1, int j1) {
		int k1 = -jn + 1024 & 0x3ff;
		int l1 = -kn + 1024 & 0x3ff;
		int i2 = -ln + 1024 & 0x3ff;
		if (i2 != 0) {
			int j2 = nm[i2];
			int i3 = nm[i2 + 1024];
			int l3 = i1 * j2 + l * i3 >> 15;
			i1 = i1 * i3 - l * j2 >> 15;
			l = l3;
		}
		if (k1 != 0) {
			int k2 = nm[k1];
			int j3 = nm[k1 + 1024];
			int i4 = i1 * j3 - j1 * k2 >> 15;
			j1 = i1 * k2 + j1 * j3 >> 15;
			i1 = i4;
		}
		if (l1 != 0) {
			int l2 = nm[l1];
			int k3 = nm[l1 + 1024];
			int j4 = j1 * l2 + l * k3 >> 15;
			j1 = j1 * k3 - l * l2 >> 15;
			l = j4;
		}
		if (l < fp)
			fp = l;
		if (l > gp)
			gp = l;
		if (i1 < hp)
			hp = i1;
		if (i1 > ip)
			ip = i1;
		if (j1 < jp)
			jp = j1;
		if (j1 > kp)
			kp = j1;
	}