private void nf(int ai[], int ai1[], int j, int k, int l, int i1, int j1, int k1, int l1, int i2) {
		int j2 = -(i1 >> 2);
		i1 = -(i1 & 3);
		for (int k2 = -j1; k2 < 0; k2 += i2) {
			for (int l2 = j2; l2 < 0; l2++) {
				j = ai1[k++];
				if (j != 0)
					ai[l++] = j;
				else
					l++;
				j = ai1[k++];
				if (j != 0)
					ai[l++] = j;
				else
					l++;
				j = ai1[k++];
				if (j != 0)
					ai[l++] = j;
				else
					l++;
				j = ai1[k++];
				if (j != 0)
					ai[l++] = j;
				else
					l++;
			}

			for (int i3 = i1; i3 < 0; i3++) {
				j = ai1[k++];
				if (j != 0)
					ai[l++] = j;
				else
					l++;
			}

			l += k1;
			k += l1;
		}

	}