public void xl() {
		for (int i1 = 0; i1 < ieb; i1++) {
			int j1 = keb[i1];
			int l1 = leb[i1];
			int k2 = meb[i1];
			int j3 = neb[i1];
			boolean flag = true;
			while (flag) {
				flag = false;
				for (int k4 = 0; k4 < i1; k4++)
					if (l1 > leb[k4] - neb[k4] && l1 - j3 < leb[k4] && j1 - k2 < keb[k4] + meb[k4]
							&& j1 + k2 > keb[k4] - meb[k4]) {
						l1 = leb[k4] - j3;
						flag = true;
					}

			}
			leb[i1] = l1;
			cu.gh(jeb[i1], j1, l1, 1, 0xffff00, 300);
		}

		for (int k1 = 0; k1 < oeb; k1++) {
			int i2 = peb[k1];
			int l2 = qeb[k1];
			int k3 = reb[k1];
			int i4 = seb[k1];
			int l4 = (39 * k3) / 100;
			int i5 = (27 * k3) / 100;
			int j5 = l2 - i5;
			cu.vg(i2 - l4 / 2, j5, l4, i5, lu + 9, 85);
			int k5 = (36 * k3) / 100;
			int l5 = (24 * k3) / 100;
			cu.cg(i2 - k5 / 2, (j5 + i5 / 2) - l5 / 2, k5, l5, Config.eib[i4] + pw, Config.qib[i4], 0, 0,
					false);
		}

		for (int j2 = 0; j2 < teb; j2++) {
			int i3 = ueb[j2];
			int l3 = veb[j2];
			int j4 = web[j2];
			cu.ag(i3 - 15, l3 - 3, j4, 5, 65280, 192);
			cu.ag((i3 - 15) + j4, l3 - 3, 30 - j4, 5, 0xff0000, 192);
		}

	}