t456j93g0345y68

--clvbrew:tm: obfuscation, fork of Ironbrew; Version v2.7.5a
return (function(l, o, e, c)
	local f = pairs;
	local t = string.sub;
	local i = string.char;
	local l = setmetatable;
	local L = string.byte;
	local A = select;
	local G = table.getn or function(e)
		return #e
	end;
	local s = unpack or table.unpack;
	local B = e;
	local h = tonumber;
	local F = table.concat;
	local E = getfenv or function()
		return _ENV
	end;
	local H = {}
	for e = 0, 255 do
		H[e] = i(e)
	end;
	local function r(d)
		local l, n, o = "", "", {}
		local a = c;
		local e = 1;
		local function f()
			local l = h(t(d, e, e), 36)
			e = e + 1;
			local n = h(t(d, e, e + l - 1), 36)
			e = e + l;
			return n
		end;
		l = i(f())
		o[1] = l;
		while e < #d do
			local e = f()
			if H[e] then
				n = H[e]
			else
				n = l..t(l, 1, 1)
			end;
			H[a] = l..t(n, 1, 1)
			o[#o + 1], l, a = n, n, a + 1
		end;
		return F(o)
	end;
	local r = r('25525625525525827625523M24J24K22C22K25524O27923K24U24W22222G23721S22L22H22622321422M23H23G22Y22U25525B27924D24G25322K22B21X25525A27924U24U24R22F22G22A21T25524X27923Z24O24P22D22N22C21Z22L28027925A24I25322822528824P25521C22S22P21G21I21G21K21K22P22T21F22Q21F22S22T21D25727925524T27625927924Q24G24O27F24Z27923U24K24X22Y22G21V21V21S22621W25429L25526X26326X2A729L21L2702AC2A82612612AH29L23D2692AL27923D26J2AP27923M2AT27624F2AW2612652AW21L26W2AW26X2622AW23D26F2AZ2AB2AD27921L26S2AW2552B42BD27621L26O2AZ2642BH23N2B826H2AZ25S2AZ2B72BK25523D26B2BH2AG2BY2612672B826D2B22C12C426026X25529V27623V24O28523228R22N22022B28U27628W28Y2902CP25528328528728927924924K25922523J22M22525529P2762D12D32C425W2BH2AS2BY21L2712AW2492CC2BY2552BP2DH2DG2A826X2CC2D827925424W2A829L2D925524U24P24K2232DH26L2B526C2BH22123Q2DN24X2BH2A92DN2492BH25L2AT24B29L23K27625P2DV27624R2762542A72DN25529K29L2492EV2752A729K2EU29O2742792F72772ES2552FB2812782F82F82502552AD2CF28K2752792CF2DY28A27923Q27628K29K2F024K27629K28A28K25926Z2F828K2A724R24A2F82FH27624G2762GD2ET2GB28U2GD2592CD2DV2F22AD23U2FW28V2FE23N2762DY28127629227629V28A2DY29L29V28K2CF27924Y2FL2D02792512CE2FC29L2HE29V2HE2H02552FK28K2DY2HL2FK28A2FK29L2HN2HM2552F22762FK2FK2H42HD2552HE2HT2I329K2HE29L2A72HA2HE2G52F827H2AD23O2EV2EZ29L2472IA2DW2I22DZ2E12E32E52BY23D2BT2DH2BA2DN2EC2EE2EG2BH2EJ2DN2EL2BK2EN27I2EQ2FD2F72EW2HB2DZ2F02HC2FL2F42IK2FB29P2FP2FE2792782E12FF2HG2FD29P2FK2FM2GS2JN2HF2552FS29L2FV28J2IK2FZ2G12CZ2G42G62DV2G82FE2GJ29P2GH2GF2JT2GI2762FG2792GM2F82GP2762GR2K52CQ2GU2GW2CU2HL2H22K12A82H62K02H92JE2HX2I329V2GH2I42HF2HK2792HV2HP2LD2CZ2I62HZ2K52FK2HY2HW2I12A82HE2I52LP2IK2I92DW2552IC2D82KB29P2IG2762II2HB2JG2552IM2LV2EV2IP2A82IR2E42E62DS26I2B22IY2DZ2J02DZ2EF2EY2J32EK2EM2EO2JA2JR2EV2EX2DZ2IK2F12F32M42JO2F82JN2FB2JQ2FA2792KM2FI2DV2JW2H12JY2H52KW2FT2762K42FX2MX2G02IK2G32LY2G72HB2GA2GC29L2KI2L92NR2GK2KN2GN29P2KQ2552KS28K2KU24R2GV2L02GY2552KY2CZ2MA2L22H82762HA2BD2LM2HI2KJ2LA2HJ2OA2LG2HO2OO2LJ2HS2A82HV2LL2LG2LO2HH2LA2LI2LA2I82A82IB2LA2IE2DV2M12552M32F52IL2IN2M92MW2N92IS2ME2AE2IW2DZ2AO2IZ2ED2DZ24T2J22EI2MP2J72MR2552ER2MT2FL2MV2JF2A82HY2542JJ2F62KN2F92ET2JP2JB2N72JT2E12JV2JE2FN2Q92NC2L02NG2552NI2K62762NL2G22K52P729P2KD2NW2KG2NT2GG2A82NW2N82D82NZ2L62GQ2GS2O52O72GX2792OB2H32L12K52OF2LW2L52OJ2HF2L92OK2LC2LJ2OQ2HQ2LH2OU2LK2L62LJ2OY2I32LR2OZ2P32IN2LX2QU27G2JE2PB2MX2762M72IJ27626729L2FT2PY2FA2KD2RJ26W2L52K629N2S827924027627527H2QA2N22N62R02PZ2NX2SU2CZ2O92FB28K2NG2FB2DY2O42N12HF2I22FB2HA2H82FB2ID2SW2HW2HA2T02532LA2T02522L32FB2922I62FB27H2TL2T02EU2TB29Q2552TO2T029N2E129L2752SN2NH2K82FY2KL29L2UA2572SN2Q12762422K824V2TH2752HL2JL2QC2R02ST2T92812TY2O52TH28K2T22792DY2TE2FQ25524Q2TH2HA2U72TF2L02T02FK2V12762TL2LU2FB2TO24S2TH2922UK2T027H2VC2JO2SY2V424U2TH29N2V42T02VI2V72792UK2UU2E22TP27924H2552W52T02GF2KI2T924J2UP25524I2552WC2T024L2W32QQ2552VL2A829K2NL2U82N02F02KS2IN2UE2IJ2M52SQ2IK2UR2FB2752VF2Q82W12782VI2T02812WF2T028A2SY28K2WN2T62WM2TH29V2W12HA2U12T92TG2VA2QJ2FB2TL2SY2TO2WJ2T02922FB2TT2WD2EU2XG2TZ2RH2K82VV2WR2PC2F023R2DZ2A72Q429L2G02JC29K24N2JH2542UA24M2RV2YL2IK2F22Q42UA2482EZ2SN2752JZ2YN2DV2X42R02J82US2552Z32FB28A2GJ2T928K24D2TH2DY24C2XJ2552ZF2T02HA2Z92V824F2TH2FK24E2TH2TL2412TH2TO2Z62RC2Z52MW29P2HL2QN2SR2QP2552YU2792JJ2M62PE2K82CU2CR28Z2882O92CW2862882NG2DB2D42D62FD310L2L52542QM2MB28B2MD2J52EB2PP2A824L2PS2DZ2J429L2Z32552EP2PX2UP2JD2EY2M52YO2Q62T92JM2TH2N52X92JU2Q82NB2K02FO2NE2QL2K32GS2UA2552QR2K92NO2KC2NQ2KF2FD2552NU2R12GJ2812QF2R52O12O32GT2O62KW2GD2OB2UT2RF2H72A82OH2JH2OM3121312M2RO2HW2RE2RR2812P12OV2RV2LN2QJ2762LQ2HW2S02TM2LV2S32LZ2S52IH2WX2PD2M82V92KU31182JR2SI2OI23T2SL29K249313I2BK2752WW2SL2762X8311C31022WS2OA2UK2AD29P2AD2SA2L531012H42SG2SU2AD2O92YE31072YO29L27831492K8314E2DV313P313T2ZQ27929K2G92SB31482SB3103314G2YD314Q2YQ314U29P314I2SL31062K83140310A');
	local a = (bit or bit32) and (bit or bit32).bxor or function(e, n)
		local l, d = 1, 0
		while e > 0 and n > 0 do
			local t, a = e % o, n % o
			if t ~= a then
				d = d + l
			end
			e, n, l = (e - t) / o, (n - a) / o, l * o
		end
		if e < n then
			e = n
		end
		while e > 0 do
			local n = e % o
			if n > 0 then
				d = d + l
			end
			e, l = (e - n) / o, l * o
		end
		return d
	end
	local function d(l, e, n)
		if n then
			local e = (l / o ^ (e - 1)) % o ^ ((n - 1) - (e - 1) + 1);
			return e - e % 1;
		else
			local e = o ^ (e - 1);
			return (l % (e + e) >= e) and 1 or 0;
		end;
	end;
	local e = 1;
	local K = 0;
	local function n()
		local d, o, l, n = L(r, e, e + 3);
		d = a(d, 185)
		o = a(o, 185)
		l = a(l, 185)
		n = a(n, 185)
		e = e + 4;
		return (n * 16777216) + (l * 65536) + (o * c) + d;
	end;
	local function h()
		local l, n = L(r, e, e + o);
		l = a(l, 185)
		n = a(n, 185)
		e = e + o;
		return (n * c) + l;
	end;
	local function T(...)
		return {
			...
		}, A('#', ...)
	end
	local function F()
		local l = a(L(r, e, e), 185);
		e = e + 1;
		return l;
	end;
	local function D()
		local s = {};
		local i = {};
		local l = {};
		local c = {
			[6] = s,
			[3] = nil,
			[9] = nil,
			[8] = i,
			[4] = l,
			[7] = {},
		};
		local f = {}
		local l = {}
		for c = 1, F() == 0 and h() * o or n() do
			local l = F();
			while c do
				if (l == o) then
					l = (F() ~= 0);
					break;
				end
				if (l == 1) then
					local n, e = n(), n();
					local t, n, e, d = 1, (d(e, 1, 20) * (o ^ 32)) + n, d(e, 21, 31), ((-1) ^ d(e, 32));
					if e == 0 then
						if n == 0 then
							l = d * 0
							break;
						else
							e = 1;
							t = 0;
						end;
					elseif (e == 2047) then
						l = (d * ((n == 0 and 1 or 0) / 0))
						break;
					end;
					l = (d * (o ^ (e - 1023))) * (t + (n / (o ^ 52)));
					break;
				end
				if (l == 3) then
					local n = n();
					l = t(r, e, e + n - 1);
					e = e + n;
					break;
				end
				if (l == 0) then
					local o, d, n = '', n();
					if (d == 0) then
						l = o;
						break;
					end;
					n = t(r, e, e + d - 1);
					n = {
						L(n, 1, #n)
					}
					e = e + d;
					for e = 1, G(n) do
						o = o..H[a(n[e], 185)]
					end
					l = o
					break;
				end
				if (l == 3) then
					local n = n();
					l = t(r, e, e + n - 1);
					e = e + n;
					break;
				end
				l = nil
				break;
			end
			print(l)
			f[c] = l;
		end;
		c[3] = F();
		if K < 1 then
			K = 1
			local l = h()
			c[o] = t(r, e, e + l - 1)
			e = e + l
		end
		for e = 1, n() do
			s[e - 1] = D();

		end;
		for s = 1, n() do
			local e = F();
			if (d(e, 1, 1) == 0) then
				local a = d(e, 4, 6);
				local t = d(e, o, 3);
				local F, r, e, l = h(), F() == 1, h(), {};
				local e = {
					[4] = nil,
					[3] = r,
					[1] = F,
					[o] = e,
				};
				if (t == o) then
					e[3] = n() - 65536
				end
				if (t == 0) then
					e[3], e[4] = h(), h()
				end
				if (t == 3) then
					e[3], e[4] = n() - 65536, h()
				end
				if (t == 1) then
					e[3] = n()
				end
				if (d(a, 3, 3) == 1) then
					l[4] = 4
					e[4] = f[e[4]]
				end
				if (d(a, 1, 1) == 1) then
					l[o] = o
					e[o] = f[e[o]]
				end
				if (d(a, o, o) == 1) then
					l[3] = 3
					e[3] = f[e[3]]
				end
				if r then
					B(c[7], e)
					e[6] = l
				end
				i[s] = e;
			end
		end;
		return c;
	end;
	local function K(e, l, r, l)
		local d = e[8];
		local l = e[9];
		local h = e[7];
		local l = e[3];
		local e = e[6];
		local n = {}
		local D = 0;
		return function(...)
			local n = {};
			local t = l;
			local l = 1;
			local F = {};
			local F = -1;
			local H = A('#', ...) - 1;
			local L = {};
			local A = e;
			local e = T
			local F = {
				...
			};
			local d = d;
			for e = 0, H do
				if (e >= t) then
					L[e - t] = F[e + 1];
				else
					n[e] = F[e + 1];
				end;
			end;
			local e;
			local t = H - t + 1
			local t;
			while true do
				e = d[l];
				t = e[1];
				if D > 0 then
					n[e[o]] = e[3];
				end
				if t <= 35 then
					if t <= 17 then
						if t <= 8 then
							if t <= 3 then
								if t <= 1 then
									if t == 0 then
										n[e[o]] = n[e[3]] * n[e[4]];
									else
										n[e[o]] = n[e[3]] % e[4];
									end;
								elseif t == o then
									n[e[o]] = n[e[3]] / n[e[4]];
								else
									local d = e[3];
									local l = n[d]
									for e = d + 1, e[4] do
										l = l..n[e];
									end;
									n[e[o]] = l;
								end;
							elseif t <= 5 then
								if t > 4 then
									local f;
									local a;
									local t;
									n[e[o]] = {};
									l = l + 1;
									e = d[l];
									n[e[o]] = e[3];
									l = l + 1;
									e = d[l];
									n[e[o]] = e[3];
									l = l + 1;
									e = d[l];
									n[e[o]] = e[3];
									l = l + 1;
									e = d[l];
									n[e[o]] = e[3];
									l = l + 1;
									e = d[l];
									n[e[o]] = e[3];
									l = l + 1;
									e = d[l];
									n[e[o]] = e[3];
									l = l + 1;
									e = d[l];
									n[e[o]] = e[3];
									l = l + 1;
									e = d[l];
									n[e[o]] = e[3];
									l = l + 1;
									e = d[l];
									n[e[o]] = e[3];
									l = l + 1;
									e = d[l];
									n[e[o]] = e[3];
									l = l + 1;
									e = d[l];
									n[e[o]] = e[3];
									l = l + 1;
									e = d[l];
									n[e[o]] = e[3];
									l = l + 1;
									e = d[l];
									n[e[o]] = e[3];
									l = l + 1;
									e = d[l];
									n[e[o]] = e[3];
									l = l + 1;
									e = d[l];
									n[e[o]] = e[3];
									l = l + 1;
									e = d[l];
									n[e[o]] = e[3];
									l = l + 1;
									e = d[l];
									n[e[o]] = e[3];
									l = l + 1;
									e = d[l];
									t = e[o];
									a = n[t];
									f = 50 * e[4];
									for e = t + 1, e[3] do
										a[f + e - t] = n[e]
									end;
								else
									n[e[o]][n[e[3]]] = n[e[4]];
								end;
							elseif t <= 6 then
								local l = e[o]
								n[l] = n[l](s(n, l + 1, e[3]))
							elseif t == 7 then
								for n, l in f(h) do
									for d, n in f(l[6]) do
										local d, e, o, t = {
											l[n]:byte(1, #l[n])
										}, '', e[o], e[3]
										for n = 1, #d do
											e, o = e..i(a(d[n], o)), (o + t) % c
										end
										l[n], l[6] = e, {};
									end
								end;
							else
								n[e[o]] = r[e[3]];
							end;
						elseif t <= 12 then
							if t <= 10 then
								if t > 9 then
									n[e[o]] = n[e[3]];
								else
									local L;
									local F;
									local H, s, t, K;
									for n, l in f(h) do
										for d, n in f(l[6]) do
											H, s, t, K = {
												l[n]:byte(1, #l[n])
											}, '', e[o], e[3]
											for e = 1, #H do
												s, t = s..i(a(H[e], t)), (t + K) % c
											end
											l[n], l[6] = s, {};
										end
									end;
									l = l + 1;
									e = d[l];
									n[e[o]] = r[e[3]];
									l = l + 1;
									e = d[l];
									n[e[o]] = n[e[3]][e[4]];
									l = l + 1;
									e = d[l];
									n[e[o]] = n[e[3]][e[4]];
									l = l + 1;
									e = d[l];
									n[e[o]] = n[e[3]][e[4]];
									l = l + 1;
									e = d[l];
									F = e[o];
									L = n[e[3]];
									n[F + 1] = L;
									n[F] = L[e[4]];
								end;
							elseif t > 11 then
								n[e[o]] = n[e[3]] + n[e[4]];
							else
								n[e[o]] = n[e[3]][e[4]];
							end;
						elseif t <= 14 then
							if t == 13 then
								n[e[o]] = n[e[3]] - n[e[4]];
							else
								local e = e[o]
								n[e] = n[e](n[e + 1])
							end;
						elseif t <= 15 then
							local l = e[o];
							local o = n[l];
							local d = 50 * e[4];
							for e = l + 1, e[3] do
								o[d + e - l] = n[e]
							end;
						elseif t == 16 then
							local d = e[o];
							local t = n[d + o];
							local o = n[d] + t;
							n[d] = o;
							if (t > 0) then
								if (o <= n[d + 1]) then
									l = e[3];
									n[d + 3] = o;
								end
							elseif (o >= n[d + 1]) then
								l = e[3];
								n[d + 3] = o;
							end
						else
							n[e[o]] = n[e[3]] % e[4];
						end;
					elseif t <= 26 then
						if t <= 21 then
							if t <= 19 then
								if t > 18 then
									local t;
									local a;
									n[e[o]] = e[3];
									l = l + 1;
									e = d[l];
									n[e[o]] = e[3] ^ n[e[4]];
									l = l + 1;
									e = d[l];
									n[e[o]] = n[e[3]] / n[e[4]];
									l = l + 1;
									e = d[l];
									n[e[o]] = n[e[3]];
									l = l + 1;
									e = d[l];
									n[e[o]] = n[e[3]] % e[4];
									l = l + 1;
									e = d[l];
									n[e[o]] = n[e[3]] - n[e[4]];
									l = l + 1;
									e = d[l];
									n[e[o]] = e[3] - n[e[4]];
									l = l + 1;
									e = d[l];
									n[e[o]] = e[3] ^ n[e[4]];
									l = l + 1;
									e = d[l];
									n[e[o]] = n[e[3]] * n[e[4]];
									l = l + 1;
									e = d[l];
									n[e[o]] = n[e[3]] % e[4];
									l = l + 1;
									e = d[l];
									n[e[o]] = n[e[3]] + n[e[4]];
									l = l + 1;
									e = d[l];
									n[e[o]] = n[e[3]][n[e[4]]];
									l = l + 1;
									e = d[l];
									a = e[3];
									t = n[a]
									for e = a + 1, e[4] do
										t = t..n[e];
									end;
									n[e[o]] = t;
								else
									local t;
									local a;
									n[e[o]] = e[3];
									l = l + 1;
									e = d[l];
									n[e[o]] = e[3] ^ n[e[4]];
									l = l + 1;
									e = d[l];
									n[e[o]] = n[e[3]] / n[e[4]];
									l = l + 1;
									e = d[l];
									n[e[o]] = n[e[3]];
									l = l + 1;
									e = d[l];
									n[e[o]] = n[e[3]] % e[4];
									l = l + 1;
									e = d[l];
									n[e[o]] = n[e[3]] - n[e[4]];
									l = l + 1;
									e = d[l];
									n[e[o]] = e[3] - n[e[4]];
									l = l + 1;
									e = d[l];
									n[e[o]] = e[3] ^ n[e[4]];
									l = l + 1;
									e = d[l];
									n[e[o]] = n[e[3]] * n[e[4]];
									l = l + 1;
									e = d[l];
									n[e[o]] = n[e[3]] % e[4];
									l = l + 1;
									e = d[l];
									n[e[o]] = n[e[3]] + n[e[4]];
									l = l + 1;
									e = d[l];
									n[e[o]] = n[e[3]][n[e[4]]];
									l = l + 1;
									e = d[l];
									a = e[3];
									t = n[a]
									for e = a + 1, e[4] do
										t = t..n[e];
									end;
									n[e[o]] = t;
								end;
							elseif t == 20 then
								n[e[o]] = K(A[e[3]], nil, r);
							else
								n[e[o]] = {};
							end;
						elseif t <= 23 then
							if t > 22 then
								local d = e[3];
								local l = n[d]
								for e = d + 1, e[4] do
									l = l..n[e];
								end;
								n[e[o]] = l;
							else
								n[e[o]][e[3]] = n[e[4]];
							end;
						elseif t <= 24 then
							n[e[o]] = K(A[e[3]], nil, r);
						elseif t > 25 then
							n[e[o]] = e[3] - n[e[4]];
						else
							n[e[o]] = #n[e[3]];
						end;
					elseif t <= 30 then
						if t <= 28 then
							if t == 27 then
								n[e[o]] = n[e[3]] * n[e[4]];
							else
								n[e[o]] = n[e[3]] + n[e[4]];
							end;
						elseif t == 29 then
							n[e[o]][n[e[3]]] = n[e[4]];
						else
							do
								return
							end;
						end;
					elseif t <= 32 then
						if t == 31 then
							local f;
							local a;
							local t;
							n[e[o]] = {};
							l = l + 1;
							e = d[l];
							n[e[o]] = e[3];
							l = l + 1;
							e = d[l];
							n[e[o]] = e[3];
							l = l + 1;
							e = d[l];
							n[e[o]] = e[3];
							l = l + 1;
							e = d[l];
							n[e[o]] = e[3];
							l = l + 1;
							e = d[l];
							n[e[o]] = e[3];
							l = l + 1;
							e = d[l];
							n[e[o]] = e[3];
							l = l + 1;
							e = d[l];
							n[e[o]] = e[3];
							l = l + 1;
							e = d[l];
							n[e[o]] = e[3];
							l = l + 1;
							e = d[l];
							n[e[o]] = e[3];
							l = l + 1;
							e = d[l];
							n[e[o]] = e[3];
							l = l + 1;
							e = d[l];
							n[e[o]] = e[3];
							l = l + 1;
							e = d[l];
							n[e[o]] = e[3];
							l = l + 1;
							e = d[l];
							t = e[o];
							a = n[t];
							f = 50 * e[4];
							for e = t + 1, e[3] do
								a[f + e - t] = n[e]
							end;
						else
							local t;
							local a;
							n[e[o]] = e[3];
							l = l + 1;
							e = d[l];
							n[e[o]] = e[3] ^ n[e[4]];
							l = l + 1;
							e = d[l];
							n[e[o]] = n[e[3]] / n[e[4]];
							l = l + 1;
							e = d[l];
							n[e[o]] = n[e[3]];
							l = l + 1;
							e = d[l];
							n[e[o]] = n[e[3]] % e[4];
							l = l + 1;
							e = d[l];
							n[e[o]] = n[e[3]] - n[e[4]];
							l = l + 1;
							e = d[l];
							n[e[o]] = e[3] - n[e[4]];
							l = l + 1;
							e = d[l];
							n[e[o]] = e[3] ^ n[e[4]];
							l = l + 1;
							e = d[l];
							n[e[o]] = n[e[3]] * n[e[4]];
							l = l + 1;
							e = d[l];
							n[e[o]] = n[e[3]] % e[4];
							l = l + 1;
							e = d[l];
							n[e[o]] = n[e[3]] + n[e[4]];
							l = l + 1;
							e = d[l];
							n[e[o]] = n[e[3]][n[e[4]]];
							l = l + 1;
							e = d[l];
							a = e[3];
							t = n[a]
							for e = a + 1, e[4] do
								t = t..n[e];
							end;
							n[e[o]] = t;
						end;
					elseif t <= 33 then
						local l = e[o]
						n[l](s(n, l + 1, e[3]))
					elseif t > 34 then
						n[e[o]] = e[3];
					else
						n[e[o]] = {};
					end;
				elseif t <= 53 then
					if t <= 44 then
						if t <= 39 then
							if t <= 37 then
								if t == 36 then
									local L;
									local r;
									local t;
									local H, F, s, K;
									for n, l in f(h) do
										for d, n in f(l[6]) do
											H, F, s, K = {
												l[n]:byte(1, #l[n])
											}, '', e[o], e[3]
											for e = 1, #H do
												F, s = F..i(a(H[e], s)), (s + K) % c
											end
											l[n], l[6] = F, {};
										end
									end;
									l = l + 1;
									e = d[l];
									n[e[o]] = e[3];
									l = l + 1;
									e = d[l];
									n[e[o]] = {};
									l = l + 1;
									e = d[l];
									n[e[o]] = n[e[3]][e[4]];
									l = l + 1;
									e = d[l];
									n[e[o]] = e[3];
									l = l + 1;
									e = d[l];
									n[e[o]] = e[3];
									l = l + 1;
									e = d[l];
									n[e[o]] = e[3];
									l = l + 1;
									e = d[l];
									t = e[o];
									r = n[t]
									L = n[t + o];
									if (L > 0) then
										if (r > n[t + 1]) then
											l = e[3];
										else
											n[t + 3] = r;
										end
									elseif (r < n[t + 1]) then
										l = e[3];
									else
										n[t + 3] = r;
									end
								else
									n[e[o]] = n[e[3]];
								end;
							elseif t > 38 then
								local a;
								local t;
								t = e[o]
								n[t](s(n, t + 1, e[3]))
								l = l + 1;
								e = d[l];
								n[e[o]] = r[e[3]];
								l = l + 1;
								e = d[l];
								n[e[o]] = n[e[3]][e[4]];
								l = l + 1;
								e = d[l];
								n[e[o]] = n[e[3]][e[4]];
								l = l + 1;
								e = d[l];
								n[e[o]] = n[e[3]][e[4]];
								l = l + 1;
								e = d[l];
								t = e[o];
								a = n[e[3]];
								n[t + 1] = a;
								n[t] = a[e[4]];
							else
								local l = e[o]
								n[l] = n[l](s(n, l + 1, e[3]))
							end;
						elseif t <= 41 then
							if t == 40 then
								local l = e[o]
								n[l](s(n, l + 1, e[3]))
							else
								local f;
								local a;
								local t;
								n[e[o]] = {};
								l = l + 1;
								e = d[l];
								n[e[o]] = e[3];
								l = l + 1;
								e = d[l];
								n[e[o]] = e[3];
								l = l + 1;
								e = d[l];
								n[e[o]] = e[3];
								l = l + 1;
								e = d[l];
								n[e[o]] = e[3];
								l = l + 1;
								e = d[l];
								n[e[o]] = e[3];
								l = l + 1;
								e = d[l];
								n[e[o]] = e[3];
								l = l + 1;
								e = d[l];
								n[e[o]] = e[3];
								l = l + 1;
								e = d[l];
								n[e[o]] = e[3];
								l = l + 1;
								e = d[l];
								n[e[o]] = e[3];
								l = l + 1;
								e = d[l];
								n[e[o]] = e[3];
								l = l + 1;
								e = d[l];
								n[e[o]] = e[3];
								l = l + 1;
								e = d[l];
								n[e[o]] = e[3];
								l = l + 1;
								e = d[l];
								n[e[o]] = e[3];
								l = l + 1;
								e = d[l];
								n[e[o]] = e[3];
								l = l + 1;
								e = d[l];
								n[e[o]] = e[3];
								l = l + 1;
								e = d[l];
								n[e[o]] = e[3];
								l = l + 1;
								e = d[l];
								n[e[o]] = e[3];
								l = l + 1;
								e = d[l];
								t = e[o];
								a = n[t];
								f = 50 * e[4];
								for e = t + 1, e[3] do
									a[f + e - t] = n[e]
								end;
							end;
						elseif t <= 42 then
							n[e[o]] = n[e[3]] - n[e[4]];
						elseif t == 43 then
							local f;
							local a;
							local t;
							n[e[o]] = {};
							l = l + 1;
							e = d[l];
							n[e[o]] = e[3];
							l = l + 1;
							e = d[l];
							n[e[o]] = e[3];
							l = l + 1;
							e = d[l];
							n[e[o]] = e[3];
							l = l + 1;
							e = d[l];
							n[e[o]] = e[3];
							l = l + 1;
							e = d[l];
							n[e[o]] = e[3];
							l = l + 1;
							e = d[l];
							n[e[o]] = e[3];
							l = l + 1;
							e = d[l];
							n[e[o]] = e[3];
							l = l + 1;
							e = d[l];
							n[e[o]] = e[3];
							l = l + 1;
							e = d[l];
							n[e[o]] = e[3];
							l = l + 1;
							e = d[l];
							n[e[o]] = e[3];
							l = l + 1;
							e = d[l];
							n[e[o]] = e[3];
							l = l + 1;
							e = d[l];
							n[e[o]] = e[3];
							l = l + 1;
							e = d[l];
							n[e[o]] = e[3];
							l = l + 1;
							e = d[l];
							n[e[o]] = e[3];
							l = l + 1;
							e = d[l];
							n[e[o]] = e[3];
							l = l + 1;
							e = d[l];
							n[e[o]] = e[3];
							l = l + 1;
							e = d[l];
							n[e[o]] = e[3];
							l = l + 1;
							e = d[l];
							n[e[o]] = e[3];
							l = l + 1;
							e = d[l];
							n[e[o]] = e[3];
							l = l + 1;
							e = d[l];
							n[e[o]] = e[3];
							l = l + 1;
							e = d[l];
							n[e[o]] = e[3];
							l = l + 1;
							e = d[l];
							n[e[o]] = e[3];
							l = l + 1;
							e = d[l];
							n[e[o]] = e[3];
							l = l + 1;
							e = d[l];
							n[e[o]] = e[3];
							l = l + 1;
							e = d[l];
							n[e[o]] = e[3];
							l = l + 1;
							e = d[l];
							n[e[o]] = e[3];
							l = l + 1;
							e = d[l];
							n[e[o]] = e[3];
							l = l + 1;
							e = d[l];
							t = e[o];
							a = n[t];
							f = 50 * e[4];
							for e = t + 1, e[3] do
								a[f + e - t] = n[e]
							end;
						else
							n[e[o]] = e[3];
						end;
					elseif t <= 48 then
						if t <= 46 then
							if t > 45 then
								do
									return
								end;
							else
								do
									print(n[e[o]])
									return n[e[o]]
								end
							end;
						elseif t == 47 then
							n[e[o]][e[3]] = n[e[4]];
						else
							n[e[o]] = n[e[3]][e[4]];
						end;
					elseif t <= 50 then
						if t == 49 then
							for n, l in f(h) do
								for n, d in f(l[6]) do
									local o, n, e, t = {
										l[d]:byte(1, #l[d])
									}, '', e[o], e[3]
									for d = 1, #o do
										n, e = n..i(a(o[d], e)), (e + t) % c
									end
									l[d], l[6] = n, {};
								end
							end;
						else
							n[e[o]] = e[3] ^ n[e[4]];
						end;
					elseif t <= 51 then
						n[e[o]] = n[e[3]][n[e[4]]];
					elseif t > 52 then
						n[e[o]] = n[e[3]][n[e[4]]];
					else
						n[e[o]] = n[e[3]] / n[e[4]];
					end;
				elseif t <= 62 then
					if t <= 57 then
						if t <= 55 then
							if t == 54 then
								local l = e[o];
								local o = n[e[3]];
								n[l + 1] = o;
								n[l] = o[e[4]];
							else
								local d = e[o];
								local t = n[d]
								local o = n[d + o];
								if (o > 0) then
									if (t > n[d + 1]) then
										l = e[3];
									else
										n[d + 3] = t;
									end
								elseif (t < n[d + 1]) then
									l = e[3];
								else
									n[d + 3] = t;
								end
							end;
						elseif t > 56 then
							local L;
							local r;
							local t;
							local H, F, s, K;
							for n, l in f(h) do
								for d, n in f(l[6]) do
									H, F, s, K = {
										l[n]:byte(1, #l[n])
									}, '', e[o], e[3]
									for e = 1, #H do
										F, s = F..i(a(H[e], s)), (s + K) % c
									end
									l[n], l[6] = F, {};
								end
							end;
							l = l + 1;
							e = d[l];
							n[e[o]] = e[3];
							l = l + 1;
							e = d[l];
							n[e[o]] = {};
							l = l + 1;
							e = d[l];
							n[e[o]] = n[e[3]][e[4]];
							l = l + 1;
							e = d[l];
							n[e[o]] = e[3];
							l = l + 1;
							e = d[l];
							n[e[o]] = e[3];
							l = l + 1;
							e = d[l];
							n[e[o]] = e[3];
							l = l + 1;
							e = d[l];
							t = e[o];
							r = n[t]
							L = n[t + o];
							if (L > 0) then
								if (r > n[t + 1]) then
									l = e[3];
								else
									n[t + 3] = r;
								end
							elseif (r < n[t + 1]) then
								l = e[3];
							else
								n[t + 3] = r;
							end
						else
							n[e[o]] = e[3] - n[e[4]];
						end;
					elseif t <= 59 then
						if t == 58 then
							local t;
							local a;
							n[e[o]] = e[3];
							l = l + 1;
							e = d[l];
							n[e[o]] = e[3] ^ n[e[4]];
							l = l + 1;
							e = d[l];
							n[e[o]] = n[e[3]] / n[e[4]];
							l = l + 1;
							e = d[l];
							n[e[o]] = n[e[3]];
							l = l + 1;
							e = d[l];
							n[e[o]] = n[e[3]] % e[4];
							l = l + 1;
							e = d[l];
							n[e[o]] = n[e[3]] - n[e[4]];
							l = l + 1;
							e = d[l];
							n[e[o]] = e[3] - n[e[4]];
							l = l + 1;
							e = d[l];
							n[e[o]] = e[3] ^ n[e[4]];
							l = l + 1;
							e = d[l];
							n[e[o]] = n[e[3]] * n[e[4]];
							l = l + 1;
							e = d[l];
							n[e[o]] = n[e[3]] % e[4];
							l = l + 1;
							e = d[l];
							n[e[o]] = n[e[3]] + n[e[4]];
							l = l + 1;
							e = d[l];
							n[e[o]] = n[e[3]][n[e[4]]];
							l = l + 1;
							e = d[l];
							a = e[3];
							t = n[a]
							for e = a + 1, e[4] do
								t = t..n[e];
							end;
							n[e[o]] = t;
						else
							n[e[o]] = #n[e[3]];
						end;
					elseif t <= 60 then
						local L;
						local r;
						local t;
						local H, F, s, K;
						for n, l in f(h) do
							for d, n in f(l[6]) do
								H, F, s, K = {
									l[n]:byte(1, #l[n])
								}, '', e[o], e[3]
								for e = 1, #H do
									F, s = F..i(a(H[e], s)), (s + K) % c
								end
								l[n], l[6] = F, {};
							end
						end;
						l = l + 1;
						e = d[l];
						n[e[o]] = e[3];
						l = l + 1;
						e = d[l];
						n[e[o]] = {};
						l = l + 1;
						e = d[l];
						n[e[o]] = n[e[3]][e[4]];
						l = l + 1;
						e = d[l];
						n[e[o]] = e[3];
						l = l + 1;
						e = d[l];
						n[e[o]] = e[3];
						l = l + 1;
						e = d[l];
						n[e[o]] = e[3];
						l = l + 1;
						e = d[l];
						t = e[o];
						r = n[t]
						L = n[t + o];
						if (L > 0) then
							if (r > n[t + 1]) then
								l = e[3];
							else
								n[t + 3] = r;
							end
						elseif (r < n[t + 1]) then
							l = e[3];
						else
							n[t + 3] = r;
						end
					elseif t > 61 then
						local a;
						local t;
						n[e[o]] = n[e[3]][n[e[4]]];
						l = l + 1;
						e = d[l];
						t = e[o];
						a = n[e[3]];
						n[t + 1] = a;
						n[t] = a[e[4]];
						l = l + 1;
						e = d[l];
						n[e[o]] = r[e[3]];
						l = l + 1;
						e = d[l];
						n[e[o]] = n[e[3]][e[4]];
						l = l + 1;
						e = d[l];
						n[e[o]] = n[e[3]][e[4]];
						l = l + 1;
						e = d[l];
						n[e[o]] = n[e[3]][e[4]];
					else
						do
							print(n[e[o]])
							return n[e[o]]
						end
					end;
				elseif t <= 67 then
					if t <= 64 then
						if t > 63 then
							local d = e[o];
							local t = n[d]
							local o = n[d + o];
							if (o > 0) then
								if (t > n[d + 1]) then
									l = e[3];
								else
									n[d + 3] = t;
								end
							elseif (t < n[d + 1]) then
								l = e[3];
							else
								n[d + 3] = t;
							end
						else
							local e = e[o]
							n[e] = n[e](n[e + 1])
						end;
					elseif t <= 65 then
						local l = e[o];
						local o = n[e[3]];
						n[l + 1] = o;
						n[l] = o[e[4]];
					elseif t == 66 then
						local d = e[o];
						local t = n[d + o];
						local o = n[d] + t;
						n[d] = o;
						if (t > 0) then
							if (o <= n[d + 1]) then
								l = e[3];
								n[d + 3] = o;
							end
						elseif (o >= n[d + 1]) then
							l = e[3];
							n[d + 3] = o;
						end
					else
						local t;
						local a;
						n[e[o]] = e[3];
						l = l + 1;
						e = d[l];
						n[e[o]] = e[3] ^ n[e[4]];
						l = l + 1;
						e = d[l];
						n[e[o]] = n[e[3]] / n[e[4]];
						l = l + 1;
						e = d[l];
						n[e[o]] = n[e[3]];
						l = l + 1;
						e = d[l];
						n[e[o]] = n[e[3]] % e[4];
						l = l + 1;
						e = d[l];
						n[e[o]] = n[e[3]] - n[e[4]];
						l = l + 1;
						e = d[l];
						n[e[o]] = e[3] - n[e[4]];
						l = l + 1;
						e = d[l];
						n[e[o]] = e[3] ^ n[e[4]];
						l = l + 1;
						e = d[l];
						n[e[o]] = n[e[3]] * n[e[4]];
						l = l + 1;
						e = d[l];
						n[e[o]] = n[e[3]] % e[4];
						l = l + 1;
						e = d[l];
						n[e[o]] = n[e[3]] + n[e[4]];
						l = l + 1;
						e = d[l];
						n[e[o]] = n[e[3]][n[e[4]]];
						l = l + 1;
						e = d[l];
						a = e[3];
						t = n[a]
						for e = a + 1, e[4] do
							t = t..n[e];
						end;
						n[e[o]] = t;
					end;
				elseif t <= 69 then
					if t > 68 then
						n[e[o]] = r[e[3]];
					else
						n[e[o]] = e[3] ^ n[e[4]];
					end;
				elseif t <= 70 then
					local L;
					local r;
					local t;
					local H, s, F, K;
					for n, l in f(h) do
						for d, n in f(l[6]) do
							H, s, F, K = {
								l[n]:byte(1, #l[n])
							}, '', e[o], e[3]
							for e = 1, #H do
								s, F = s..i(a(H[e], F)), (F + K) % c
							end
							l[n], l[6] = s, {};
						end
					end;
					l = l + 1;
					e = d[l];
					n[e[o]] = e[3];
					l = l + 1;
					e = d[l];
					n[e[o]] = {};
					l = l + 1;
					e = d[l];
					n[e[o]] = n[e[3]][e[4]];
					l = l + 1;
					e = d[l];
					n[e[o]] = e[3];
					l = l + 1;
					e = d[l];
					n[e[o]] = e[3];
					l = l + 1;
					e = d[l];
					n[e[o]] = e[3];
					l = l + 1;
					e = d[l];
					t = e[o];
					r = n[t]
					L = n[t + o];
					if (L > 0) then
						if (r > n[t + 1]) then
							l = e[3];
						else
							n[t + 3] = r;
						end
					elseif (r < n[t + 1]) then
						l = e[3];
					else
						n[t + 3] = r;
					end
				elseif t > 71 then
					local l = e[o];
					local o = n[l];
					local d = 50 * e[4];
					for e = l + 1, e[3] do
						o[d + e - l] = n[e]
					end;
				else
					local K;
					local r;
					local t;
					local H, s, F, L;
					for n, l in f(h) do
						for d, n in f(l[6]) do
							H, s, F, L = {
								l[n]:byte(1, #l[n])
							}, '', e[o], e[3]
							for e = 1, #H do
								s, F = s..i(a(H[e], F)), (F + L) % c
							end
							l[n], l[6] = s, {};
						end
					end;
					l = l + 1;
					e = d[l];
					n[e[o]] = e[3];
					l = l + 1;
					e = d[l];
					n[e[o]] = {};
					l = l + 1;
					e = d[l];
					n[e[o]] = n[e[3]][e[4]];
					l = l + 1;
					e = d[l];
					n[e[o]] = e[3];
					l = l + 1;
					e = d[l];
					n[e[o]] = e[3];
					l = l + 1;
					e = d[l];
					n[e[o]] = e[3];
					l = l + 1;
					e = d[l];
					t = e[o];
					r = n[t]
					K = n[t + o];
					if (K > 0) then
						if (r > n[t + 1]) then
							l = e[3];
						else
							n[t + 3] = r;
						end
					elseif (r < n[t + 1]) then
						l = e[3];
					else
						n[t + 3] = r;
					end
				end;
				l = l + 1;
			end;
		end;
	end;
	return s({
		K(D(), {}, E())()
	}) or nil;
end)(({
	1
})[1], 2, table.insert, 256)