Code deobfuscation

Terzilion · August 24, 2024, 7:38am

Hello! I want deobfuscate this code:

Obfuscated Code

 local d=string.byte;local f=string.char;local c=string.sub;local s=table.concat;local r=math.ldexp;local R=getfenv or function()return _ENV end;local l=setmetatable;local h=select;local i=unpack;local V=tonumber;local function B(d)local e,n,t="","",{}local o=256;local a={}for l=0,o-1 do a[l]=f(l)end;local l=1;local function i()local e=V(c(d,l,l),36)l=l+1;local n=V(c(d,l,l+e-1),36)l=l+e;return n end;e=f(i())t[1]=e;while l<#d do local l=i()if a[l]then n=a[l]else n=e..c(e,1,1)end;a[o]=e..c(n,1,1)t[#t+1],e,o=n,n,o+1 end;return table.concat(t)end;local t=B('23Z23V27527623V27427623X27626W26G26X26A26Z27323V27B27526326I26X26M26D27I23N27626726C26Z26026Z26M26M26N23V23Y27626526I26F27226M23V23L27625J23N23F23821G27S23V25I23V24R23V21N27628K25728N27625F28E23821N28I25E23N28M28X27528Z29128Y23N28R29223V28Z25N28N28I25I24R24B28N28M28J28I29927727927527K23V27D27F27H27J27627M27O27Q23V23K27625R26M26W27326A26D26I2A626C26D28228428628828A28C28V28H27528K29128P23V29828T28V29929429D2932902AV29A2972AY29B2AY29F29H21N29J25I29L28I29N27729Q29S27G27I29Q29X27P27I28327526126C2722732892BL23V28528728928B27528D28F2AK28J28L28S2AL2AP2C423V28U28F2AT2AX2CB2952AW29829629C2992B429I2AL2B92772752BA29V2752BE29U2BH27N2BJ2AD27527X27Z2812BS2BU28823U2CO2772BA26726B26X26C27327326F26M2D62CO23F2502DI27723F21G23V24E2AI28F21929E2C328O2C52AQ2C52CI27625T29J2B623V1B25G24328F1R2432E62BZ2381N2DV28M2162AO26J23V2EJ2AL24R26Z23V21029J2EE2EG2C52EI2AO28R2EN2C229C2F025H24R26323V21B28M2E72E92382EB2ED28V2EV2C22EX2C52EL2F029F1B2ER2B728I21K28I2462BB27526K26I26E2BW27625O26M27326026M26X27126A26G2892A127525F2DE27W2G52G72G92CY23V26Z26G28626F23V2BA2G127325M26W26Q26D26G23V24927626B2GE26W24X24K24K26K26C26C26K2DG24L26G26C26E23V23W27627O26Y27226A27O2DI21V21H2331423U25L23V23M27626426B26A2BQ26F26A2A523V2EC27525925524Z24Z26L25926M26I26I24Z25724Z25A26G25B25A2ID24Y26L26N2592IC23V24727626Q26B26B26R26G25626X27326C26I28826P27326Y27326Z2GV27325825A26B26E25925926K26R27827627027N2AC2EL27525Q27227O26826I24L24R26V24R2DA26M24R2FW2FY24R26C27026D2G52K826X2K52DC27226Z2K52FX2K42K92KB2KE2KM26W24R25Q26726024K26126I26A28726R24R25A2JZ26027327N2A626D26K2EP2DC26N27226G27324R2A72I026A28626A26P2A926A2AB24L23V25O2762JU2JW2JY2K02K226B2K42K62KL2KA2KC26C2KE26K2KG2KI2M12K82M32KE26N26C2A424R26D2DD2MB26D2KR2KT2KV2KX2KZ2L12LQ2BD27E2BF2CR23V2BI29Z2HH2752A32A52DC26Q23S2752JS23V2LU26M2JX2JZ2K125F26726726324R2HJ2882A52KQ2CW2MH2MJ27P26I26H2DG26N24Q2F52DG26I26W2K42NR2NT2K42I024R26L2M52MM2KU2KW2KY2722L025A24R2J424R26W2LD2G926W26W26L27226F26F26Q24R26F2J526N2LQ29O2JP2I02GP27T27V2D02802GJ2D42GA2A22A42L72LN2AB2GJ2BN2BP2BR27626Z27F29Z24P2LT2KT2L124R2H524R25E26D2LI2LK2LM2AA2ML2HD26E26Z2DG2BQ2OW2HG27625K26B26I2L82P52N023V25K2AB2KB2LE2GJ2P42812682DS2382122EH2C725R2FB21N2I625I2432912I625F24R2CA29J25Q2MX2C725M2762DX23V25Z2572CA28R29A24R29829J25N24Z2CA24Z27525Z25N28F21429C23V25M24B28M1L29H23V25D1J2752132S12E71R2EA1R2E625Y2432S81S2I62NH2RQ2F62MX25V2RQ25V27525Y24R2RW29J25X29J2132F92E82EA2EC1B25Z26J28F1N2JS25V26B2RQ26B2SM24B29H21C2RY25G2S62FC2S82SY2T02EF2T326Z28F1Z2EQ23V25Y2T928N2RY25Z26R2CA2JM2TP28M23U2E52TY23V2U029J2SN24B2U42T82B52TC25F2EA25F2E625D25N24R23U1T29C2E72RK2FC2RM2TH2T12T31J2TM2S12TP2TR21N2TT2TV28W2TX2SN2U32U12V32U82TY2U72V52UX2TT2172T12172SM23N29H21528I2TU2TW2SM2TZ2V52F52V725V2V021N2TX25U24J2V42VX23V2VW2VY2752VW2632U02VZ2VW26J2W62SM21N2F621N2DX2VL2EF2V22TZ21H2U52EP2VR2VT2VV2VX2WA2W02WQ21N2W724J26Z2WR2W82WR25Y2WC28N2WF2WO2VN2V42WL1B23U21629J2VS28F1H2WP2W22WS2XH2VW2X92WU2W324J2W92XM2TP2X22WE2RN21V2CA21V27525V22J2CA22J2U92TS2RN2X52U22XA2WL2U32XB2VN2W52YB2TY21N2Y82VN22323U1S29J26723V28F1V2762SA29H21L2I62WG2VU2X62V72V62VP2WX2VP2YG2VP2YJ2U126728V1V28I2YS23V2YU2Y52VM2Y72VP2X72VN2XL2WL2Z42WL2Z62YM24B2YP2RY2ZC1M2YV2Y62Z02WL22J2YZ24R2ZN2YI2V72672FB1V2I62ZC21C2QV2FQ28I');local o=bit and bit.bxor or function(l,n)local e,o=1,0 while l>0 and n>0 do local a,c=l%2,n%2 if a~=c then o=o+e end l,n,e=(l-a)/2,(n-c)/2,e*2 end if l<n then l=n end while l>0 do local n=l%2 if n>0 then o=o+e end l,e=(l-n)/2,e*2 end return o end local function e(n,l,e)if e then local l=(n/2^(l-1))%2^((e-1)-(l-1)+1);return l-l%1;else local l=2^(l-1);return(n%(l+l)>=l)and 1 or 0;end;end;local l=1;local function n()local c,n,a,e=d(t,l,l+3);c=o(c,139)n=o(n,139)a=o(a,139)e=o(e,139)l=l+4;return(e*16777216)+(a*65536)+(n*256)+c;end;local function a()local e=o(d(t,l,l),139);l=l+1;return e;end;local function V()local o=n();local l=n();local c=1;local o=(e(l,1,20)*(2^32))+o;local n=e(l,21,31);local l=((-1)^e(l,32));if(n==0)then if(o==0)then return l*0;else n=1;c=0;end;elseif(n==2047)then return(o==0)and(l*(1/0))or(l*(0/0));end;return r(l,n-1023)*(c+(o/(2^52)));end;local r=n;local function C(e)local n;if(not e)then e=r();if(e==0)then return'';end;end;n=c(t,l,l+e-1);l=l+e;local e={}for l=1,#n do e[l]=f(o(d(c(n,l,l)),139))end return s(e);end;local l=n;local function f(...)return{...},h('#',...)end local function B()local d={0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0};local l={0,0,0,0};local c={};local t={d,nil,l,nil,c};for e=1,n()do l[e-1]=B();end;local l=n()local c={0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0};for n=1,l do local e=a();local l;if(e==3)then l=(a()~=0);elseif(e==1)then l=V();elseif(e==0)then l=C();end;c[n]=l;end;t[2]=c t[4]=a();for a=1,n()do local c=o(n(),77);local n=o(n(),176);local o=e(c,1,2);local l=e(n,1,11);local l={l,e(c,3,11),nil,nil,n};if(o==0)then l[3]=e(c,12,20);l[5]=e(c,21,29);elseif(o==1)then l[3]=e(n,12,33);elseif(o==2)then l[3]=e(n,12,32)-1048575;elseif(o==3)then l[3]=e(n,12,32)-1048575;l[5]=e(c,21,29);end;d[a]=l;end;return t;end;local function s(l,e,t)local n=l[1];local o=l[2];local e=l[3];local l=l[4];return function(...)local c=n;local o=o;local B=e;local a=l;local l=f local e=1;local d=-1;local r={};local V={...};local f=h('#',...)-1;local l={};local n={};for l=0,f do if(l>=a)then r[l-a]=V[l+1];else n[l]=V[l+1];end;end;local l=f-a+1 local l;local a;while true do l=c[e];a=l[1];if a<=22 then if a<=10 then if a<=4 then if a<=1 then if a==0 then local c=l[2];local e=n[l[3]];n[c+1]=e;n[c]=e[o[l[5]]];else n[l[2]]=t[o[l[3]]];end;elseif a<=2 then local V;local r;local f;local h;local a;a=l[2];h={};f=0;r=a+l[3]-1;for l=a+1,r do f=f+1;h[f]=n[l];end;n[a](i(h,1,r-a));d=a;e=e+1;l=c[e];n[l[2]]=t[o[l[3]]];e=e+1;l=c[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=c[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=c[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=c[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=c[e];a=l[2];V=n[l[3]];n[a+1]=V;n[a]=V[o[l[5]]];elseif a>3 then n[l[2]]=n[l[3]];else do return end;end;elseif a<=7 then if a<=5 then if(o[l[2]]<n[l[5]])then e=e+1;else e=e+l[3];end;elseif a==6 then n[l[2]]=n[l[3]][o[l[5]]];else if(n[l[2]]<o[l[5]])then e=e+1;else e=e+l[3];end;end;elseif a<=8 then if(n[l[2]]==o[l[5]])then e=e+1;else e=e+l[3];end;elseif a==9 then local o=l[2];local a={};local e=0;local c=o+l[3]-1;for l=o+1,c do e=e+1;a[e]=n[l];end;local c={n[o](i(a,1,c-o))};local l=o+l[5]-2;e=0;for l=o,l do e=e+1;n[l]=c[e];end;d=l;else if n[l[2]]then e=e+1;else e=e+l[3];end;end;elseif a<=16 then if a<=13 then if a<=11 then local e=l[2];local c={};local o=0;local l=e+l[3]-1;for l=e+1,l do o=o+1;c[o]=n[l];end;n[e](i(c,1,l-e));d=e;elseif a==12 then local e=l[2];local c={};local o=0;local l=e+l[3]-1;for l=e+1,l do o=o+1;c[o]=n[l];end;n[e](i(c,1,l-e));d=e;else n[l[2]][o[l[3]]]=o[l[5]];end;elseif a<=14 then n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=c[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=c[e];n[l[2]]=t[o[l[3]]];e=e+1;l=c[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=c[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=c[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=c[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=c[e];n[l[2]][o[l[3]]]=n[l[5]];e=e+1;l=c[e];n[l[2]]=t[o[l[3]]];e=e+1;l=c[e];n[l[2]]=n[l[3]][o[l[5]]];elseif a==15 then n[l[2]]=t[o[l[3]]];e=e+1;l=c[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=c[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=c[e];n[l[2]]=t[o[l[3]]];e=e+1;l=c[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=c[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=c[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=c[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=c[e];n[l[2]][o[l[3]]]=n[l[5]];e=e+1;l=c[e];do return end;else n[l[2]]=n[l[3]];end;elseif a<=19 then if a<=17 then n[l[2]]=n[l[3]][o[l[5]]];elseif a>18 then n[l[2]]=o[l[3]];else n[l[2]]();d=A;e=e+1;l=c[e];n[l[2]]=t[o[l[3]]];e=e+1;l=c[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=c[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=c[e];n[l[2]]=t[o[l[3]]];e=e+1;l=c[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=c[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=c[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=c[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=c[e];n[l[2]][o[l[3]]]=n[l[5]];end;elseif a<=20 then if(n[l[2]]<o[l[5]])then e=e+1;else e=e+l[3];end;elseif a==21 then e=e+l[3];else n[l[2]]=t[o[l[3]]];e=e+1;l=c[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=c[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=c[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=c[e];if(o[l[2]]<n[l[5]])then e=e+1;else e=e+l[3];end;end;elseif a<=34 then if a<=28 then if a<=25 then if a<=23 then local r;local h;local f;local V;local a;n[l[2]]=o[l[3]];e=e+1;l=c[e];a=l[2];V={};f=0;h=a+l[3]-1;for l=a+1,h do f=f+1;V[f]=n[l];end;n[a](i(V,1,h-a));d=a;e=e+1;l=c[e];n[l[2]]=t[o[l[3]]];e=e+1;l=c[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=c[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=c[e];a=l[2];r=n[l[3]];n[a+1]=r;n[a]=r[o[l[5]]];e=e+1;l=c[e];a=l[2];V={};f=0;h=a+l[3]-1;for l=a+1,h do f=f+1;V[f]=n[l];end;n[a](i(V,1,h-a));d=a;e=e+1;l=c[e];e=e+l[3];elseif a>24 then n[l[2]]=s(B[l[3]],nil,t);else local r;local V;local f;local h;local a;n[l[2]]=o[l[3]];e=e+1;l=c[e];a=l[2];h={};f=0;V=a+l[3]-1;for l=a+1,V do f=f+1;h[f]=n[l];end;n[a](i(h,1,V-a));d=a;e=e+1;l=c[e];n[l[2]]=t[o[l[3]]];e=e+1;l=c[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=c[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=c[e];a=l[2];r=n[l[3]];n[a+1]=r;n[a]=r[o[l[5]]];e=e+1;l=c[e];a=l[2];h={};f=0;V=a+l[3]-1;for l=a+1,V do f=f+1;h[f]=n[l];end;n[a](i(h,1,V-a));d=a;end;elseif a<=26 then n[l[2]][o[l[3]]]=n[l[5]];elseif a>27 then if n[l[2]]then e=e+1;else e=e+l[3];end;else n[l[2]]=o[l[3]];end;elseif a<=31 then if a<=29 then local r;local V;local f;local h;local A;local a;n[l[2]]=t[o[l[3]]];e=e+1;l=c[e];a=l[2];A=n[l[3]];n[a+1]=A;n[a]=A[o[l[5]]];e=e+1;l=c[e];n[l[2]]=o[l[3]];e=e+1;l=c[e];a=l[2];h={};f=0;V=a+l[3]-1;for l=a+1,V do f=f+1;h[f]=n[l];end;r={n[a](i(h,1,V-a))};V=a+l[5]-2;f=0;for l=a,V do f=f+1;n[l]=r[f];end;d=V;e=e+1;l=c[e];n[l[2]]=t[o[l[3]]];e=e+1;l=c[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=c[e];n[l[2]]=n[l[3]];e=e+1;l=c[e];n[l[2]]=o[l[3]];e=e+1;l=c[e];a=l[2];h={};f=0;V=a+l[3]-1;for l=a+1,V do f=f+1;h[f]=n[l];end;r={n[a](i(h,1,V-a))};V=a+l[5]-2;f=0;for l=a,V do f=f+1;n[l]=r[f];end;d=V;e=e+1;l=c[e];n[l[2]]=t[o[l[3]]];elseif a==30 then n[l[2]]();d=A;else n[l[2]][o[l[3]]]=o[l[5]];end;elseif a<=32 then e=e+l[3];elseif a==33 then n[l[2]]=t[o[l[3]]];e=e+1;l=c[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=c[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=c[e];n[l[2]]=t[o[l[3]]];e=e+1;l=c[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=c[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=c[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=c[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=c[e];n[l[2]][o[l[3]]]=n[l[5]];e=e+1;l=c[e];do return end;else n[l[2]]();d=A;end;elseif a<=40 then if a<=37 then if a<=35 then n[l[2]]=t[o[l[3]]];e=e+1;l=c[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=c[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=c[e];n[l[2]]=t[o[l[3]]];e=e+1;l=c[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=c[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=c[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=c[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=c[e];n[l[2]][o[l[3]]]=n[l[5]];e=e+1;l=c[e];do return end;elseif a==36 then n[l[2]]=s(B[l[3]],nil,t);else if(o[l[2]]<n[l[5]])then e=e+1;else e=e+l[3];end;end;elseif a<=38 then if(n[l[2]]==o[l[5]])then e=e+1;else e=e+l[3];end;elseif a==39 then local c=l[2];local e=n[l[3]];n[c+1]=e;n[c]=e[o[l[5]]];else local r;local h;local f;local V;local a;a=l[2];V={};f=0;h=a+l[3]-1;for l=a+1,h do f=f+1;V[f]=n[l];end;n[a](i(V,1,h-a));d=a;e=e+1;l=c[e];n[l[2]]=t[o[l[3]]];e=e+1;l=c[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=c[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=c[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=c[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=c[e];a=l[2];r=n[l[3]];n[a+1]=r;n[a]=r[o[l[5]]];end;elseif a<=43 then if a<=41 then n[l[2]][o[l[3]]]=n[l[5]];elseif a==42 then local h;local f;local V;local a;n[l[2]]=t[o[l[3]]];e=e+1;l=c[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=c[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=c[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=c[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=c[e];n[l[2]][o[l[3]]]=n[l[5]];e=e+1;l=c[e];n[l[2]]=t[o[l[3]]];e=e+1;l=c[e];n[l[2]]=o[l[3]];e=e+1;l=c[e];a=l[2];V={};f=0;h=a+l[3]-1;for l=a+1,h do f=f+1;V[f]=n[l];end;n[a](i(V,1,h-a));d=a;e=e+1;l=c[e];n[l[2]]=t[o[l[3]]];else do return end;end;elseif a<=44 then n[l[2]]=t[o[l[3]]];elseif a>45 then local o=l[2];local c={};local e=0;local a=o+l[3]-1;for l=o+1,a do e=e+1;c[e]=n[l];end;local c={n[o](i(c,1,a-o))};local l=o+l[5]-2;e=0;for l=o,l do e=e+1;n[l]=c[e];end;d=l;else local V;local r;local f;local h;local a;a=l[2];h={};f=0;r=a+l[3]-1;for l=a+1,r do f=f+1;h[f]=n[l];end;n[a](i(h,1,r-a));d=a;e=e+1;l=c[e];n[l[2]]=t[o[l[3]]];e=e+1;l=c[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=c[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=c[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=c[e];a=l[2];V=n[l[3]];n[a+1]=V;n[a]=V[o[l[5]]];end;e=e+1;end;end;end;return s(B(),{},R())();

Formatted Code

local d = string.byte;
local f = string.char;
local c = string.sub;
local s = table.concat;
local r = math.ldexp;
local R = getfenv or function()
	return _ENV
end;
local l = setmetatable;
local h = select;
local i = unpack;
local V = tonumber;
local function B(d)
	local e, n, t = "", "", {}
	local o = 256;
	local a = {}
	for l = 0, o - 1 do
		a[l] = f(l)
	end;
	local l = 1;
	local function i()
		local e = V(c(d, l, l), 36)
		l = l + 1;
		local n = V(c(d, l, l + e - 1), 36)
		l = l + e;
		return n
	end;
	e = f(i())
	t[1] = e;
	while l < #d do
		local l = i()
		if a[l] then
			n = a[l]
		else
			n = e .. c(e, 1, 1)
		end;
		a[o] = e .. c(n, 1, 1)
		t[#t + 1], e, o = n, n, o + 1
	end;
	return table.concat(t)
end;
local t = B('23Z23V27527623V27427623X27626W26G26X26A26Z27323V27B27526326I26X26M26D27I23N27626726C26Z26026Z26M26M26N23V23Y27626526I26F27226M23V23L27625J23N23F23821G27S23V25I23V24R23V21N27628K25728N27625F28E23821N28I25E23N28M28X27528Z29128Y23N28R29223V28Z25N28N28I25I24R24B28N28M28J28I29927727927527K23V27D27F27H27J27627M27O27Q23V23K27625R26M26W27326A26D26I2A626C26D28228428628828A28C28V28H27528K29128P23V29828T28V29929429D2932902AV29A2972AY29B2AY29F29H21N29J25I29L28I29N27729Q29S27G27I29Q29X27P27I28327526126C2722732892BL23V28528728928B27528D28F2AK28J28L28S2AL2AP2C423V28U28F2AT2AX2CB2952AW29829629C2992B429I2AL2B92772752BA29V2752BE29U2BH27N2BJ2AD27527X27Z2812BS2BU28823U2CO2772BA26726B26X26C27327326F26M2D62CO23F2502DI27723F21G23V24E2AI28F21929E2C328O2C52AQ2C52CI27625T29J2B623V1B25G24328F1R2432E62BZ2381N2DV28M2162AO26J23V2EJ2AL24R26Z23V21029J2EE2EG2C52EI2AO28R2EN2C229C2F025H24R26323V21B28M2E72E92382EB2ED28V2EV2C22EX2C52EL2F029F1B2ER2B728I21K28I2462BB27526K26I26E2BW27625O26M27326026M26X27126A26G2892A127525F2DE27W2G52G72G92CY23V26Z26G28626F23V2BA2G127325M26W26Q26D26G23V24927626B2GE26W24X24K24K26K26C26C26K2DG24L26G26C26E23V23W27627O26Y27226A27O2DI21V21H2331423U25L23V23M27626426B26A2BQ26F26A2A523V2EC27525925524Z24Z26L25926M26I26I24Z25724Z25A26G25B25A2ID24Y26L26N2592IC23V24727626Q26B26B26R26G25626X27326C26I28826P27326Y27326Z2GV27325825A26B26E25925926K26R27827627027N2AC2EL27525Q27227O26826I24L24R26V24R2DA26M24R2FW2FY24R26C27026D2G52K826X2K52DC27226Z2K52FX2K42K92KB2KE2KM26W24R25Q26726024K26126I26A28726R24R25A2JZ26027327N2A626D26K2EP2DC26N27226G27324R2A72I026A28626A26P2A926A2AB24L23V25O2762JU2JW2JY2K02K226B2K42K62KL2KA2KC26C2KE26K2KG2KI2M12K82M32KE26N26C2A424R26D2DD2MB26D2KR2KT2KV2KX2KZ2L12LQ2BD27E2BF2CR23V2BI29Z2HH2752A32A52DC26Q23S2752JS23V2LU26M2JX2JZ2K125F26726726324R2HJ2882A52KQ2CW2MH2MJ27P26I26H2DG26N24Q2F52DG26I26W2K42NR2NT2K42I024R26L2M52MM2KU2KW2KY2722L025A24R2J424R26W2LD2G926W26W26L27226F26F26Q24R26F2J526N2LQ29O2JP2I02GP27T27V2D02802GJ2D42GA2A22A42L72LN2AB2GJ2BN2BP2BR27626Z27F29Z24P2LT2KT2L124R2H524R25E26D2LI2LK2LM2AA2ML2HD26E26Z2DG2BQ2OW2HG27625K26B26I2L82P52N023V25K2AB2KB2LE2GJ2P42812682DS2382122EH2C725R2FB21N2I625I2432912I625F24R2CA29J25Q2MX2C725M2762DX23V25Z2572CA28R29A24R29829J25N24Z2CA24Z27525Z25N28F21429C23V25M24B28M1L29H23V25D1J2752132S12E71R2EA1R2E625Y2432S81S2I62NH2RQ2F62MX25V2RQ25V27525Y24R2RW29J25X29J2132F92E82EA2EC1B25Z26J28F1N2JS25V26B2RQ26B2SM24B29H21C2RY25G2S62FC2S82SY2T02EF2T326Z28F1Z2EQ23V25Y2T928N2RY25Z26R2CA2JM2TP28M23U2E52TY23V2U029J2SN24B2U42T82B52TC25F2EA25F2E625D25N24R23U1T29C2E72RK2FC2RM2TH2T12T31J2TM2S12TP2TR21N2TT2TV28W2TX2SN2U32U12V32U82TY2U72V52UX2TT2172T12172SM23N29H21528I2TU2TW2SM2TZ2V52F52V725V2V021N2TX25U24J2V42VX23V2VW2VY2752VW2632U02VZ2VW26J2W62SM21N2F621N2DX2VL2EF2V22TZ21H2U52EP2VR2VT2VV2VX2WA2W02WQ21N2W724J26Z2WR2W82WR25Y2WC28N2WF2WO2VN2V42WL1B23U21629J2VS28F1H2WP2W22WS2XH2VW2X92WU2W324J2W92XM2TP2X22WE2RN21V2CA21V27525V22J2CA22J2U92TS2RN2X52U22XA2WL2U32XB2VN2W52YB2TY21N2Y82VN22323U1S29J26723V28F1V2762SA29H21L2I62WG2VU2X62V72V62VP2WX2VP2YG2VP2YJ2U126728V1V28I2YS23V2YU2Y52VM2Y72VP2X72VN2XL2WL2Z42WL2Z62YM24B2YP2RY2ZC1M2YV2Y62Z02WL22J2YZ24R2ZN2YI2V72672FB1V2I62ZC21C2QV2FQ28I');
local o = bit and bit.bxor or function(l, n)
	local e, o = 1, 0
	while l > 0 and n > 0 do
		local a, c = l % 2, n % 2
		if a ~= c then
			o = o + e
		end
		l, n, e = (l - a) / 2, (n - c) / 2, e * 2
	end
	if l < n then
		l = n
	end
	while l > 0 do
		local n = l % 2
		if n > 0 then
			o = o + e
		end
		l, e = (l - n) / 2, e * 2
	end
	return o
end
local function e(n, l, e)
	if e then
		local l = (n / 2 ^ (l - 1)) % 2 ^ ((e - 1) - (l - 1) + 1);
		return l - l % 1;
	else
		local l = 2 ^ (l - 1);
		return (n % (l + l) >= l) and 1 or 0;
	end;
end;
local l = 1;
local function n()
	local c, n, a, e = d(t, l, l + 3);
	c = o(c, 139)
	n = o(n, 139)
	a = o(a, 139)
	e = o(e, 139)
	l = l + 4;
	return (e * 16777216) + (a * 65536) + (n * 256) + c;
end;
local function a()
	local e = o(d(t, l, l), 139);
	l = l + 1;
	return e;
end;
local function V()
	local o = n();
	local l = n();
	local c = 1;
	local o = (e(l, 1, 20) * (2 ^ 32)) + o;
	local n = e(l, 21, 31);
	local l = ((-1) ^ e(l, 32));
	if (n == 0) then
		if (o == 0) then
			return l * 0;
		else
			n = 1;
			c = 0;
		end;
	elseif (n == 2047) then
		return (o == 0) and (l * (1 / 0)) or (l * (0 / 0));
	end;
	return r(l, n - 1023) * (c + (o / (2 ^ 52)));
end;
local r = n;
local function C(e)
	local n;
	if (not e) then
		e = r();
		if (e == 0) then
			return '';
		end;
	end;
	n = c(t, l, l + e - 1);
	l = l + e;
	local e = {}
	for l = 1, #n do
		e[l] = f(o(d(c(n, l, l)), 139))
	end
	return s(e);
end;
local l = n;
local function f(...)
	return {
		...
	}, h('#', ...)
end
local function B()
	local d = {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0};
	local l = {
		0,
		0,
		0,
		0
	};
	local c = {};
	local t = {
		d,
		nil,
		l,
		nil,
		c
	};
	for e = 1, n() do
		l[e - 1] = B();
	end;
	local l = n()
	local c = {
		0,
		0,
		0,
		0,
		0,
		0,
		0,
		0,
		0,
		0,
		0,
		0,
		0,
		0,
		0,
		0,
		0,
		0,
		0,
		0,
		0,
		0,
		0,
		0,
		0,
		0,
		0,
		0,
		0
	};
	for n = 1, l do
		local e = a();
		local l;
		if (e == 3) then
			l = (a() ~= 0);
		elseif (e == 1) then
			l = V();
		elseif (e == 0) then
			l = C();
		end;
		c[n] = l;
	end;
	t[2] = c
	t[4] = a();
	for a = 1, n() do
		local c = o(n(), 77);
		local n = o(n(), 176);
		local o = e(c, 1, 2);
		local l = e(n, 1, 11);
		local l = {
			l,
			e(c, 3, 11),
			nil,
			nil,
			n
		};
		if (o == 0) then
			l[3] = e(c, 12, 20);
			l[5] = e(c, 21, 29);
		elseif (o == 1) then
			l[3] = e(n, 12, 33);
		elseif (o == 2) then
			l[3] = e(n, 12, 32) - 1048575;
		elseif (o == 3) then
			l[3] = e(n, 12, 32) - 1048575;
			l[5] = e(c, 21, 29);
		end;
		d[a] = l;
	end;
	return t;
end;
local function s(l, e, t)
	local n = l[1];
	local o = l[2];
	local e = l[3];
	local l = l[4];
	return function(...)
		local c = n;
		local o = o;
		local B = e;
		local a = l;
		local l = f
		local e = 1;
		local d = -1;
		local r = {};
		local V = {
			...
		};
		local f = h('#', ...) - 1;
		local l = {};
		local n = {};
		for l = 0, f do
			if (l >= a) then
				r[l - a] = V[l + 1];
			else
				n[l] = V[l + 1];
			end;
		end;
		local l = f - a + 1
		local l;
		local a;
		while true do
			l = c[e];
			a = l[1];
			if a <= 22 then
				if a <= 10 then
					if a <= 4 then
						if a <= 1 then
							if a == 0 then
								local c = l[2];
								local e = n[l[3]];
								n[c + 1] = e;
								n[c] = e[o[l[5]]];
							else
								n[l[2]] = t[o[l[3]]];
							end;
						elseif a <= 2 then
							local V;
							local r;
							local f;
							local h;
							local a;
							a = l[2];
							h = {};
							f = 0;
							r = a + l[3] - 1;
							for l = a + 1, r do
								f = f + 1;
								h[f] = n[l];
							end;
							n[a](i(h, 1, r - a));
							d = a;
							e = e + 1;
							l = c[e];
							n[l[2]] = t[o[l[3]]];
							e = e + 1;
							l = c[e];
							n[l[2]] = n[l[3]][o[l[5]]];
							e = e + 1;
							l = c[e];
							n[l[2]] = n[l[3]][o[l[5]]];
							e = e + 1;
							l = c[e];
							n[l[2]] = n[l[3]][o[l[5]]];
							e = e + 1;
							l = c[e];
							n[l[2]] = n[l[3]][o[l[5]]];
							e = e + 1;
							l = c[e];
							a = l[2];
							V = n[l[3]];
							n[a + 1] = V;
							n[a] = V[o[l[5]]];
						elseif a > 3 then
							n[l[2]] = n[l[3]];
						else
							do
								return
							end;
						end;
					elseif a <= 7 then
						if a <= 5 then
							if (o[l[2]] < n[l[5]]) then
								e = e + 1;
							else
								e = e + l[3];
							end;
						elseif a == 6 then
							n[l[2]] = n[l[3]][o[l[5]]];
						else
							if (n[l[2]] < o[l[5]]) then
								e = e + 1;
							else
								e = e + l[3];
							end;
						end;
					elseif a <= 8 then
						if (n[l[2]] == o[l[5]]) then
							e = e + 1;
						else
							e = e + l[3];
						end;
					elseif a == 9 then
						local o = l[2];
						local a = {};
						local e = 0;
						local c = o + l[3] - 1;
						for l = o + 1, c do
							e = e + 1;
							a[e] = n[l];
						end;
						local c = {
							n[o](i(a, 1, c - o))
						};
						local l = o + l[5] - 2;
						e = 0;
						for l = o, l do
							e = e + 1;
							n[l] = c[e];
						end;
						d = l;
					else
						if n[l[2]] then
							e = e + 1;
						else
							e = e + l[3];
						end;
					end;
				elseif a <= 16 then
					if a <= 13 then
						if a <= 11 then
							local e = l[2];
							local c = {};
							local o = 0;
							local l = e + l[3] - 1;
							for l = e + 1, l do
								o = o + 1;
								c[o] = n[l];
							end;
							n[e](i(c, 1, l - e));
							d = e;
						elseif a == 12 then
							local e = l[2];
							local c = {};
							local o = 0;
							local l = e + l[3] - 1;
							for l = e + 1, l do
								o = o + 1;
								c[o] = n[l];
							end;
							n[e](i(c, 1, l - e));
							d = e;
						else
							n[l[2]][o[l[3]]] = o[l[5]];
						end;
					elseif a <= 14 then
						n[l[2]] = n[l[3]][o[l[5]]];
						e = e + 1;
						l = c[e];
						n[l[2]] = n[l[3]][o[l[5]]];
						e = e + 1;
						l = c[e];
						n[l[2]] = t[o[l[3]]];
						e = e + 1;
						l = c[e];
						n[l[2]] = n[l[3]][o[l[5]]];
						e = e + 1;
						l = c[e];
						n[l[2]] = n[l[3]][o[l[5]]];
						e = e + 1;
						l = c[e];
						n[l[2]] = n[l[3]][o[l[5]]];
						e = e + 1;
						l = c[e];
						n[l[2]] = n[l[3]][o[l[5]]];
						e = e + 1;
						l = c[e];
						n[l[2]][o[l[3]]] = n[l[5]];
						e = e + 1;
						l = c[e];
						n[l[2]] = t[o[l[3]]];
						e = e + 1;
						l = c[e];
						n[l[2]] = n[l[3]][o[l[5]]];
					elseif a == 15 then
						n[l[2]] = t[o[l[3]]];
						e = e + 1;
						l = c[e];
						n[l[2]] = n[l[3]][o[l[5]]];
						e = e + 1;
						l = c[e];
						n[l[2]] = n[l[3]][o[l[5]]];
						e = e + 1;
						l = c[e];
						n[l[2]] = t[o[l[3]]];
						e = e + 1;
						l = c[e];
						n[l[2]] = n[l[3]][o[l[5]]];
						e = e + 1;
						l = c[e];
						n[l[2]] = n[l[3]][o[l[5]]];
						e = e + 1;
						l = c[e];
						n[l[2]] = n[l[3]][o[l[5]]];
						e = e + 1;
						l = c[e];
						n[l[2]] = n[l[3]][o[l[5]]];
						e = e + 1;
						l = c[e];
						n[l[2]][o[l[3]]] = n[l[5]];
						e = e + 1;
						l = c[e];
						do
							return
						end;
					else
						n[l[2]] = n[l[3]];
					end;
				elseif a <= 19 then
					if a <= 17 then
						n[l[2]] = n[l[3]][o[l[5]]];
					elseif a > 18 then
						n[l[2]] = o[l[3]];
					else
						n[l[2]]();
						d = A;
						e = e + 1;
						l = c[e];
						n[l[2]] = t[o[l[3]]];
						e = e + 1;
						l = c[e];
						n[l[2]] = n[l[3]][o[l[5]]];
						e = e + 1;
						l = c[e];
						n[l[2]] = n[l[3]][o[l[5]]];
						e = e + 1;
						l = c[e];
						n[l[2]] = t[o[l[3]]];
						e = e + 1;
						l = c[e];
						n[l[2]] = n[l[3]][o[l[5]]];
						e = e + 1;
						l = c[e];
						n[l[2]] = n[l[3]][o[l[5]]];
						e = e + 1;
						l = c[e];
						n[l[2]] = n[l[3]][o[l[5]]];
						e = e + 1;
						l = c[e];
						n[l[2]] = n[l[3]][o[l[5]]];
						e = e + 1;
						l = c[e];
						n[l[2]][o[l[3]]] = n[l[5]];
					end;
				elseif a <= 20 then
					if (n[l[2]] < o[l[5]]) then
						e = e + 1;
					else
						e = e + l[3];
					end;
				elseif a == 21 then
					e = e + l[3];
				else
					n[l[2]] = t[o[l[3]]];
					e = e + 1;
					l = c[e];
					n[l[2]] = n[l[3]][o[l[5]]];
					e = e + 1;
					l = c[e];
					n[l[2]] = n[l[3]][o[l[5]]];
					e = e + 1;
					l = c[e];
					n[l[2]] = n[l[3]][o[l[5]]];
					e = e + 1;
					l = c[e];
					if (o[l[2]] < n[l[5]]) then
						e = e + 1;
					else
						e = e + l[3];
					end;
				end;
			elseif a <= 34 then
				if a <= 28 then
					if a <= 25 then
						if a <= 23 then
							local r;
							local h;
							local f;
							local V;
							local a;
							n[l[2]] = o[l[3]];
							e = e + 1;
							l = c[e];
							a = l[2];
							V = {};
							f = 0;
							h = a + l[3] - 1;
							for l = a + 1, h do
								f = f + 1;
								V[f] = n[l];
							end;
							n[a](i(V, 1, h - a));
							d = a;
							e = e + 1;
							l = c[e];
							n[l[2]] = t[o[l[3]]];
							e = e + 1;
							l = c[e];
							n[l[2]] = n[l[3]][o[l[5]]];
							e = e + 1;
							l = c[e];
							n[l[2]] = n[l[3]][o[l[5]]];
							e = e + 1;
							l = c[e];
							a = l[2];
							r = n[l[3]];
							n[a + 1] = r;
							n[a] = r[o[l[5]]];
							e = e + 1;
							l = c[e];
							a = l[2];
							V = {};
							f = 0;
							h = a + l[3] - 1;
							for l = a + 1, h do
								f = f + 1;
								V[f] = n[l];
							end;
							n[a](i(V, 1, h - a));
							d = a;
							e = e + 1;
							l = c[e];
							e = e + l[3];
						elseif a > 24 then
							n[l[2]] = s(B[l[3]], nil, t);
						else
							local r;
							local V;
							local f;
							local h;
							local a;
							n[l[2]] = o[l[3]];
							e = e + 1;
							l = c[e];
							a = l[2];
							h = {};
							f = 0;
							V = a + l[3] - 1;
							for l = a + 1, V do
								f = f + 1;
								h[f] = n[l];
							end;
							n[a](i(h, 1, V - a));
							d = a;
							e = e + 1;
							l = c[e];
							n[l[2]] = t[o[l[3]]];
							e = e + 1;
							l = c[e];
							n[l[2]] = n[l[3]][o[l[5]]];
							e = e + 1;
							l = c[e];
							n[l[2]] = n[l[3]][o[l[5]]];
							e = e + 1;
							l = c[e];
							a = l[2];
							r = n[l[3]];
							n[a + 1] = r;
							n[a] = r[o[l[5]]];
							e = e + 1;
							l = c[e];
							a = l[2];
							h = {};
							f = 0;
							V = a + l[3] - 1;
							for l = a + 1, V do
								f = f + 1;
								h[f] = n[l];
							end;
							n[a](i(h, 1, V - a));
							d = a;
						end;
					elseif a <= 26 then
						n[l[2]][o[l[3]]] = n[l[5]];
					elseif a > 27 then
						if n[l[2]] then
							e = e + 1;
						else
							e = e + l[3];
						end;
					else
						n[l[2]] = o[l[3]];
					end;
				elseif a <= 31 then
					if a <= 29 then
						local r;
						local V;
						local f;
						local h;
						local A;
						local a;
						n[l[2]] = t[o[l[3]]];
						e = e + 1;
						l = c[e];
						a = l[2];
						A = n[l[3]];
						n[a + 1] = A;
						n[a] = A[o[l[5]]];
						e = e + 1;
						l = c[e];
						n[l[2]] = o[l[3]];
						e = e + 1;
						l = c[e];
						a = l[2];
						h = {};
						f = 0;
						V = a + l[3] - 1;
						for l = a + 1, V do
							f = f + 1;
							h[f] = n[l];
						end;
						r = {
							n[a](i(h, 1, V - a))
						};
						V = a + l[5] - 2;
						f = 0;
						for l = a, V do
							f = f + 1;
							n[l] = r[f];
						end;
						d = V;
						e = e + 1;
						l = c[e];
						n[l[2]] = t[o[l[3]]];
						e = e + 1;
						l = c[e];
						n[l[2]] = n[l[3]][o[l[5]]];
						e = e + 1;
						l = c[e];
						n[l[2]] = n[l[3]];
						e = e + 1;
						l = c[e];
						n[l[2]] = o[l[3]];
						e = e + 1;
						l = c[e];
						a = l[2];
						h = {};
						f = 0;
						V = a + l[3] - 1;
						for l = a + 1, V do
							f = f + 1;
							h[f] = n[l];
						end;
						r = {
							n[a](i(h, 1, V - a))
						};
						V = a + l[5] - 2;
						f = 0;
						for l = a, V do
							f = f + 1;
							n[l] = r[f];
						end;
						d = V;
						e = e + 1;
						l = c[e];
						n[l[2]] = t[o[l[3]]];
					elseif a == 30 then
						n[l[2]]();
						d = A;
					else
						n[l[2]][o[l[3]]] = o[l[5]];
					end;
				elseif a <= 32 then
					e = e + l[3];
				elseif a == 33 then
					n[l[2]] = t[o[l[3]]];
					e = e + 1;
					l = c[e];
					n[l[2]] = n[l[3]][o[l[5]]];
					e = e + 1;
					l = c[e];
					n[l[2]] = n[l[3]][o[l[5]]];
					e = e + 1;
					l = c[e];
					n[l[2]] = t[o[l[3]]];
					e = e + 1;
					l = c[e];
					n[l[2]] = n[l[3]][o[l[5]]];
					e = e + 1;
					l = c[e];
					n[l[2]] = n[l[3]][o[l[5]]];
					e = e + 1;
					l = c[e];
					n[l[2]] = n[l[3]][o[l[5]]];
					e = e + 1;
					l = c[e];
					n[l[2]] = n[l[3]][o[l[5]]];
					e = e + 1;
					l = c[e];
					n[l[2]][o[l[3]]] = n[l[5]];
					e = e + 1;
					l = c[e];
					do
						return
					end;
				else
					n[l[2]]();
					d = A;
				end;
			elseif a <= 40 then
				if a <= 37 then
					if a <= 35 then
						n[l[2]] = t[o[l[3]]];
						e = e + 1;
						l = c[e];
						n[l[2]] = n[l[3]][o[l[5]]];
						e = e + 1;
						l = c[e];
						n[l[2]] = n[l[3]][o[l[5]]];
						e = e + 1;
						l = c[e];
						n[l[2]] = t[o[l[3]]];
						e = e + 1;
						l = c[e];
						n[l[2]] = n[l[3]][o[l[5]]];
						e = e + 1;
						l = c[e];
						n[l[2]] = n[l[3]][o[l[5]]];
						e = e + 1;
						l = c[e];
						n[l[2]] = n[l[3]][o[l[5]]];
						e = e + 1;
						l = c[e];
						n[l[2]] = n[l[3]][o[l[5]]];
						e = e + 1;
						l = c[e];
						n[l[2]][o[l[3]]] = n[l[5]];
						e = e + 1;
						l = c[e];
						do
							return
						end;
					elseif a == 36 then
						n[l[2]] = s(B[l[3]], nil, t);
					else
						if (o[l[2]] < n[l[5]]) then
							e = e + 1;
						else
							e = e + l[3];
						end;
					end;
				elseif a <= 38 then
					if (n[l[2]] == o[l[5]]) then
						e = e + 1;
					else
						e = e + l[3];
					end;
				elseif a == 39 then
					local c = l[2];
					local e = n[l[3]];
					n[c + 1] = e;
					n[c] = e[o[l[5]]];
				else
					local r;
					local h;
					local f;
					local V;
					local a;
					a = l[2];
					V = {};
					f = 0;
					h = a + l[3] - 1;
					for l = a + 1, h do
						f = f + 1;
						V[f] = n[l];
					end;
					n[a](i(V, 1, h - a));
					d = a;
					e = e + 1;
					l = c[e];
					n[l[2]] = t[o[l[3]]];
					e = e + 1;
					l = c[e];
					n[l[2]] = n[l[3]][o[l[5]]];
					e = e + 1;
					l = c[e];
					n[l[2]] = n[l[3]][o[l[5]]];
					e = e + 1;
					l = c[e];
					n[l[2]] = n[l[3]][o[l[5]]];
					e = e + 1;
					l = c[e];
					n[l[2]] = n[l[3]][o[l[5]]];
					e = e + 1;
					l = c[e];
					a = l[2];
					r = n[l[3]];
					n[a + 1] = r;
					n[a] = r[o[l[5]]];
				end;
			elseif a <= 43 then
				if a <= 41 then
					n[l[2]][o[l[3]]] = n[l[5]];
				elseif a == 42 then
					local h;
					local f;
					local V;
					local a;
					n[l[2]] = t[o[l[3]]];
					e = e + 1;
					l = c[e];
					n[l[2]] = n[l[3]][o[l[5]]];
					e = e + 1;
					l = c[e];
					n[l[2]] = n[l[3]][o[l[5]]];
					e = e + 1;
					l = c[e];
					n[l[2]] = n[l[3]][o[l[5]]];
					e = e + 1;
					l = c[e];
					n[l[2]] = n[l[3]][o[l[5]]];
					e = e + 1;
					l = c[e];
					n[l[2]][o[l[3]]] = n[l[5]];
					e = e + 1;
					l = c[e];
					n[l[2]] = t[o[l[3]]];
					e = e + 1;
					l = c[e];
					n[l[2]] = o[l[3]];
					e = e + 1;
					l = c[e];
					a = l[2];
					V = {};
					f = 0;
					h = a + l[3] - 1;
					for l = a + 1, h do
						f = f + 1;
						V[f] = n[l];
					end;
					n[a](i(V, 1, h - a));
					d = a;
					e = e + 1;
					l = c[e];
					n[l[2]] = t[o[l[3]]];
				else
					do
						return
					end;
				end;
			elseif a <= 44 then
				n[l[2]] = t[o[l[3]]];
			elseif a > 45 then
				local o = l[2];
				local c = {};
				local e = 0;
				local a = o + l[3] - 1;
				for l = o + 1, a do
					e = e + 1;
					c[e] = n[l];
				end;
				local c = {
					n[o](i(c, 1, a - o))
				};
				local l = o + l[5] - 2;
				e = 0;
				for l = o, l do
					e = e + 1;
					n[l] = c[e];
				end;
				d = l;
			else
				local V;
				local r;
				local f;
				local h;
				local a;
				a = l[2];
				h = {};
				f = 0;
				r = a + l[3] - 1;
				for l = a + 1, r do
					f = f + 1;
					h[f] = n[l];
				end;
				n[a](i(h, 1, r - a));
				d = a;
				e = e + 1;
				l = c[e];
				n[l[2]] = t[o[l[3]]];
				e = e + 1;
				l = c[e];
				n[l[2]] = n[l[3]][o[l[5]]];
				e = e + 1;
				l = c[e];
				n[l[2]] = n[l[3]][o[l[5]]];
				e = e + 1;
				l = c[e];
				n[l[2]] = n[l[3]][o[l[5]]];
				e = e + 1;
				l = c[e];
				a = l[2];
				V = n[l[3]];
				n[a + 1] = V;
				n[a] = V[o[l[5]]];
			end;
			e = e + 1;
		end;
	end;
end;
return s(B(), {}, R())();

After run it in Visual Studio Code i got more strange symbols

Chat GPT say me do this:

Chat GPT code

local function decode(encoded_string)
    local function from_base36(str)
        return tonumber(str, 36)
    end

    local dictionary = {}
    for i = 0, 255 do
        dictionary[i] = string.char(i)
    end

    local result = {}
    local position = 1
    local length = #encoded_string

    local function read_next()
        local num_chars = from_base36(encoded_string:sub(position, position))
        position = position + 1
        local value = from_base36(encoded_string:sub(position, position + num_chars - 1))
        position = position + num_chars
        return value
    end

    local first_char = string.char(read_next())
    table.insert(result, first_char)

    local prev = first_char

    while position <= length do
        local value = read_next()
        local next_char

        if dictionary[value] then
            next_char = dictionary[value]
        else
            next_char = prev .. prev:sub(1, 1)
        end

        table.insert(result, next_char)
        dictionary[#dictionary + 1] = prev .. next_char:sub(1, 1)
        prev = next_char
    end

    return table.concat(result)
end

local decoded_string = decode('23Z23V27527623V27427623X27626W26G26X26A26Z27323V27B27526326I26X26M26D27I23N27626726C26Z26026Z26M26M26N23V23Y27626526I26F27226M23V23L27625J23N23F23821G27S23V25I23V24R23V21N27628K25728N27625F28E23821N28I25E23N28M28X27528Z29128Y23N28R29223V28Z25N28N28I25I24R24B28N28M28J28I29927727927527K23V27D27F27H27J27627M27O27Q23V23K27625R26M26W27326A26D26I2A626C26D28228428628828A28C28V28H27528K29128P23V29828T28V29929429D2932902AV29A2972AY29B2AY29F29H21N29J25I29L28I29N27729Q29S27G27I29Q29X27P27I28327526126C2722732892BL23V28528728928B27528D28F2AK28J28L28S2AL2AP2C423V28U28F2AT2AX2CB2952AW29829629C2992B429I2AL2B92772752BA29V2752BE29U2BH27N2BJ2AD27527X27Z2812BS2BU28823U2CO2772BA26726B26X26C27327326F26M2D62CO23F2502DI27723F21G23V24E2AI28F21929E2C328O2C52AQ2C52CI27625T29J2B623V1B25G24328F1R2432E62BZ2381N2DV28M2162AO26J23V2EJ2AL24R26Z23V21029J2EE2EG2C52EI2AO28R2EN2C229C2F025H24R26323V21B28M2E72E92382EB2ED28V2EV2C22EX2C52EL2F029F1B2ER2B728I21K28I2462BB27526K26I26E2BW27625O26M27326026M26X27126A26G2892A127525F2DE27W2G52G72G92CY23V26Z26G28626F23V2BA2G127325M26W26Q26D26G23V24927626B2GE26W24X24K24K26K26C26C26K2DG24L26G26C26E23V23W27627O26Y27226A27O2DI21V21H2331423U25L23V23M27626426B26A2BQ26F26A2A523V2EC27525925524Z24Z26L25926M26I26I24Z25724Z25A26G25B25A2ID24Y26L26N2592IC23V24727626Q26B26B26R26G25626X27326C26I28826P27326Y27326Z2GV27325825A26B26E25925926K26R27827627027N2AC2EL27525Q27227O26826I24L24R26V24R2DA26M24R2FW2FY24R26C27026D2G52K826X2K52DC27226Z2K52FX2K42K92KB2KE2KM26W24R25Q26726024K26126I26A28726R24R25A2JZ26027327N2A626D26K2EP2DC26N27226G27324R2A72I026A28626A26P2A926A2AB24L23V25O2762JU2JW2JY2K02K226B2K42K62KL2KA2KC26C2KE26K2KG2KI2M12K82M32KE26N26C2A424R26D2DD2MB26D2KR2KT2KV2KX2KZ2L12LQ2BD27E2BF2CR23V2BI29Z2HH2752A32A52DC26Q23S2752JS23V2LU26M2JX2JZ2K125F26726726324R2HJ2882A52KQ2CW2MH2MJ27P26I26H2DG26N24Q2F52DG26I26W2K42NR2NT2K42I024R26L2M52MM2KU2KW2KY2722L025A24R2J424R26W2LD2G926W26W26L27226F26F26Q24R26F2J526N2LQ29O2JP2I02GP27T27V2D02802GJ2D42GA2A22A42L72LN2AB2GJ2BN2BP2BR27626Z27F29Z24P2LT2KT2L124R2H524R25E26D2LI2LK2LM2AA2ML2HD26E26Z2DG2BQ2OW2HG27625K26B26I2L82P52N023V25K2AB2KB2LE2GJ2P42812682DS2382122EH2C725R2FB21N2I625I2432912I625F24R2CA29J25Q2MX2C725M2762DX23V25Z2572CA28R29A24R29829J25N24Z2CA24Z27525Z25N28F21429C23V25M24B28M1L29H23V25D1J2752132S12E71R2EA1R2E625Y2432S81S2I62NH2RQ2F62MX25V2RQ25V27525Y24R2RW29J25X29J2132F92E82EA2EC1B25Z26J28F1N2JS25V26B2RQ26B2SM24B29H21C2RY25G2S62FC2S82SY2T02EF2T326Z28F1Z2EQ23V25Y2T928N2RY25Z26R2CA2JM2TP28M23U2E52TY23V2U029J2SN24B2U42T82B52TC25F2EA25F2E625D25N24R23U1T29C2E72RK2FC2RM2TH2T12T31J2TM2S12TP2TR21N2TT2TV28W2TX2SN2U32U12V32U82TY2U72V52UX2TT2172T12172SM23N29H21528I2TU2TW2SM2TZ2V52F52V725V2V021N2TX25U24J2V42VX23V2VW2VY2752VW2632U02VZ2VW26J2W62SM21N2F621N2DX2VL2EF2V22TZ21H2U52EP2VR2VT2VV2VX2WA2W02WQ21N2W724J26Z2WR2W82WR25Y2WC28N2WF2WO2VN2V42WL1B23U21629J2VS28F1H2WP2W22WS2XH2VW2X92WU2W324J2W92XM2TP2X22WE2RN21V2CA21V27525V22J2CA22J2U92TS2RN2X52U22XA2WL2U32XB2VN2W52YB2TY21N2Y82VN22323U1S29J26723V28F1V2762SA29H21L2I62WG2VU2X62V72V62VP2WX2VP2YG2VP2YJ2U126728V1V28I2YS23V2YU2Y52VM2Y72VP2X72VN2XL2WL2Z42WL2Z62YM24B2YP2RY2ZC1M2YV2Y62Z02WL22J2YZ24R2ZN2YI2V72672FB1V2I62ZC21C2QV2FQ28I')

print(decoded_string)

After run Chat GPT code i got this:

Result

��������������������������������������������������������ǃ{t4���Ƌ��;���Ƌ��;���Ã{t;�����;�����;�����;���ˋ;���ƫ��;���ƃ��;������������������������������������������������勎����������ǃ{t4���Ƌ��;���Ƌ��;���Ã{t;�����;�����;�����;���ˋ;���ƫ��;���ƃ��;����������������������������������������������������ǃ{t4���Ƌ��;���Ƌ��;���Ã{t;�����;�����;�����;���ˋ;���ƫ��;���ƃ��;�������������������������������������������������������������������������{��������{4�����ǃ{t-���Ƌ��;���Ƌ��;���Ƌˋ;���ѫ��;��ē{te��ǃ{t���Ƌ��*���Ƌ�*���ƫ��$���ǃ{t���Ƌ��*���Ƌ��*���Ƌˋ*���ūۋ/��ē{te��ǃ{t���Ƌ��*���Ƌ�*���ƫ�$���ƃ��8�����������������������������������������������狃����������苙�������������������拌����������C5o�ɋ��������������������������곻��迾���������������������������������潽�󋏋������닋������ꥫ�����������������������������������������ؤ�����󫾥������������������������������奋̋�������ꥫ������������������������������������������������ؤ�����󫾥���������������������������������򈋋닋������ꥫ�����۫����������������������磌���������������������ؤ�����󫾫�����������������屢����������������������������������������勎����������������������ث���������������������������屢����������������������������������ǃ{t&���Ƌ��;���ϓ{t;���Ɠ��;���ë{t;���΋ۋ;���ʋ��;���׻{t;���«��;���˳{t;�����{t(ˋ�ʛ��������'��e{tee�֓e������{t(ۋ���{t(Ӌ�֫�����ի��'��ē{te����{t닋��{t(㋋֛��0����e{tee���{t닋��{t#���֛��;�����{t;�֫��;���֫��;���֫��;���֛��;�����{teË�˫�ˋĳ{te����{t닋�{t#��֛��;�����{t;�֫��;���֫��;���֫��;���֛��;����+{t+��փ��)�����{t;�֫��;���֫ۊ;�����{t;�ң��;���ң��;���ңۊ;���ң�;����;ۋ;;����{t�֫��5���֫��;�����{t;�ң��;���ң��;���ң��;���ң�;����;ۋ;;����{t;�֫��;���֫�*�����{t�ң��;���ң��;���ң�;���ң�;����;ۋ;;���C{t;C���[{t;[��֛��;�����{t;�֫��*���֫��*���֫ۊ*���֫;�*���֫K����ߋ{t���֓��9�����{t;�֫��;���֫��;���֫��;���֫;�;���֫K�;���߃{t���֓��9�����{t;�֫��;���֫��;���֫�;���֫;�;���֫K�;���ߛ{t���֓�������{t;�֫��;���֫[�;���֫;�;���֫K�;���ߓ{t���֓��0���ƃ��8���

cjhatter · August 24, 2024, 7:39am

I will look into it, but from a quick glance it looks like a sketchy backdoor require.

I’ll return with more information

Terzilion · August 24, 2024, 7:50am

I can say what this script print in game

cjhatter · August 24, 2024, 8:06am

This obfuscation is either made by a program or an extremely secretive/smart programmer.

Some stuff I’ve uncovered so far:

The inital B function returns this string:

������ǃ{t4��Ƌ��;��Ƌ��;��Ã{t;��;��;��;��ˋ;��ƫ��;��ƃ��;��勎����ǃ{t4��Ƌ��;��Ƌ��;��Ã{t;��;��;��;��ˋ;��ƫ��;��ƃ��;������ǃ{t4��Ƌ��;��Ƌ��;��Ã{t;��;��;��;��ˋ;��ƫ��;��ƃ��;��������{��{4��ǃ{t-��Ƌ��;��Ƌ��;��Ƌˋ;��ѫ��;��ē{te��ǃ{t��Ƌ����Ƌ����ƫ��$��ǃ{t��Ƌ����Ƌ����Ƌˋ��ūۋ/��ē{te��ǃ{t��Ƌ����Ƌ��ƫ�$��ƃ��8��������狃��苙��拌���C5o�ɋ��곻��迾��潽�󋏋��닋��ꥫ��ؤ��󫾥��奋̋��ꥫ��ؤ��󫾥��򈋋닋��ꥫ��۫��磌��ؤ��󫾫��屢������勎����ث��屢����ǃ{t&��Ƌ��;��ϓ{t;��Ɠ��;��ë{t;��΋ۋ;��ʋ��;��׻{t;��«��;��˳{t;��{t(ˋ�ʛ��’��e{tee�֓e��{t(ۋ��{t(Ӌ�֫��ի��’��ē{te��{t닋��{t(㋋֛��0��e{tee��{t닋��{t#��֛��;��{t;��֫��;��֫��;��֫��;��֛��;��{teË�˫�ˋĳ{te��{t닋�{t#��֛��;��{t;��֫��;��֫��;��֫��;��֛��;��+{t+��փ��)��{t;��֫��;��֫ۊ;��{t;��ң��;��ң��;��ңۊ;��ң��;��;ۋ;;��{t��֫��5��֫��;��{t;��ң��;��ң��;��ң��;��ң��;��;ۋ;;��{t;��֫��;��֫��{t��ң��;��ң��;��ң�;��ң��;��;ۋ;;��C{t;C��[{t;[��֛��;��{t;��֫����֫����֫ۊ��֫;���֫K��ߋ{t��֓��9��{t;��֫��;��֫��;��֫��;��֫;�;��֫K�;��߃{t��֓��9��{t;��֫��;��֫��;��֫�;��֫;�;��֫K�;��ߛ{t��֓��{t;��֫��;��֫[�;��֫;�;��֫K�;��ߓ{t��֓��0��ƃ��8��

cjhatter · August 24, 2024, 8:06am

A breakdown if you want of the first half:

	local e, n, t = "", "", {}
	local o = 256;
	local a = {}
	for l = 0, o - 1 do -- Creating a loop for every ASCII char from 0-256
		a[l] = f(l)
	end;
	local l = 1;
	local function i()
		local e = V(c(d, l, l), 36) -- Converts the current character into a number in base36 
		l = l + 1; -- increases the loop by 1
		local n = V(c(d, l, l + e - 1), 36) -- Converts the string of characters from the current number to e (2 lines up) minus 1, jesus wtf
		l = l + e; -- TLDR: the line above gets the current loop number (ex. 1) and adds whatever the e variable returned (ex. 2) and turns the string of characters from (1) to (2-1) into a number
		-- the line above this also adds the e variable to the loop...
		return n
	end;
	
	-- [[ The entire 'i' function above returns the number 143 ]] --
	
	e = f(i()) -- gets the ASCII character of whatever the i loop (seen above) returns
	-- In this case it would return the 143 ASCII character which is � (it doesn't exist..)
	t[1] = e;
	while l < #d do
		local l = i()
		if a[l] then
			n = a[l]
		else
			n = e .. c(e, 1, 1)
		end;
		a[o] = e .. c(n, 1, 1)
		t[#t + 1], e, o = n, n, o + 1
	end;
	return table.concat(t)
end;

-- I didn't bother disecting the rest of the B() function but it returns that```

Terzilion · August 24, 2024, 8:23am

This is main code, but he ecrypt, i think functions in script can decrypt this part of code to use it

Terzilion · August 24, 2024, 8:27am

what method you use to decrypt function b?

Judgy_Oreo · August 24, 2024, 11:09am

I spent some time on it, but I didn’t get anything interesting. This doesn’t look like a backdoor, it looks like some paid asset copy-protection. Here is what I found:

An authorization system that checks the Owner of the Place the script is running in: https://parcelroblox.com/ (What it requires at the start).
Seemingly from a paid product called “ETS/Railux 5”:

image952×68 14.1 KB
References to instances named “Speed”, “TopSpeed”, “Route” and “Destination”. It seems like the “Product” is a train.

Here’s the full API Call dump:

> GetAsync:  https://google.com (RESPONSE OVERRIDEN)  -  Server - Sandbox:103
> Enable the 'Continue' Attribute to continue execution  -  Server - Sandbox:28
> GetAsync response: <EMPTY RESPONSE OVERRIDE>  -  Server - Sandbox:107
> Require: 9428572121  -  Server - Sandbox:82
> UrlEncode: "6288f6eaa8085c456e9fd6f6"  -  Server - Sandbox:148
> UrlEncode: "yhhxc1rtoaueztqtpynt75hm66gx"  -  Server - Sandbox:148
> RequestAsync:   ▼  {
	["Url"] = "https://whitelist.parcelroblox.com/v1/check?hubID=6288f6eaa8085c456e9fd6f6&productID=yhhxc1rtoaueztqtpynt75hm66gx&robloxID=1"
} (RESPONSE OVERRIDEN)  -  Server - Sandbox:131
> Enable the 'Continue' Attribute to continue execution  -  Server - Sandbox:28
> RequestAsync response  ▼  {
	["Body"] = "{"status":"200","message":"OK","details":{"robloxID":"1","owned":true}}",
	["Success"] = true
}  -  Server - Sandbox:135
> JSONDecode:  {"status":"200","message":"OK","details":{"robloxID":"1","owned":true}}  -  Server - Sandbox:144
> Eureka. | The game owner or group game owner owns ETS/Railux 5. Starting product initialization.  -  Server
> __index: script.Parent  -  Server - Sandbox:42
> __index: script.Parent.TopSpeed  -  Server - Sandbox:42
> __index: script.Parent  -  Server - Sandbox:42
> __index: script.Parent.Parent  -  Server - Sandbox:42
> __index: script.Parent.Parent.TopSpeed  -  Server - Sandbox:42
> __index: script.Parent.Parent.TopSpeed.Value  -  Server - Sandbox:42
> __newindex: script.Parent.TopSpeed.Value = [TRKR:script.Parent.Parent.TopSpeed.Value]  -  Server - Sandbox:47
> __index: script.Parent  -  Server - Sandbox:42
> __index: script.Parent.Destination  -  Server - Sandbox:42
> __index: script.Parent  -  Server - Sandbox:42
> __index: script.Parent.Parent  -  Server - Sandbox:42
> __index: script.Parent.Parent.Destination  -  Server - Sandbox:42
> __index: script.Parent.Parent.Destination.Value  -  Server - Sandbox:42
> __newindex: script.Parent.Destination.Value = [TRKR:script.Parent.Parent.Destination.Value]  -  Server - Sandbox:47
> __index: script.Parent  -  Server - Sandbox:42
> __index: script.Parent.Route  -  Server - Sandbox:42
> __index: script.Parent  -  Server - Sandbox:42
> __index: script.Parent.Parent  -  Server - Sandbox:42
> __index: script.Parent.Parent.Route  -  Server - Sandbox:42
> __index: script.Parent.Parent.Route.Value  -  Server - Sandbox:42
> __newindex: script.Parent.Route.Value = [TRKR:script.Parent.Parent.Route.Value]  -  Server - Sandbox:47
> ETS 5 // Initialization completed.  -  Server
> __index: script.Parent  -  Server - Sandbox:42
> __index: script.Parent.Parent  -  Server - Sandbox:42
> __index: script.Parent.Parent.TopSpeed  -  Server - Sandbox:42
> __index: script.Parent.Parent.TopSpeed.Changed  -  Server - Sandbox:42
> __index: script.Parent.Parent.TopSpeed.Changed.Connect  -  Server - Sandbox:42
> __call: script.Parent.Parent.TopSpeed.Changed.Connect:[TRKR:script.Parent.Parent.TopSpeed.Changed](function: 0x7b927c4685897008: function)  -  Server - Sandbox:56
> __index: script.Parent  -  Server - Sandbox:42
> __index: script.Parent.Parent  -  Server - Sandbox:42
> __index: script.Parent.Parent.Destination  -  Server - Sandbox:42
> __index: script.Parent.Parent.Destination.Changed  -  Server - Sandbox:42
> __index: script.Parent.Parent.Destination.Changed.Connect  -  Server - Sandbox:42
> __call: script.Parent.Parent.Destination.Changed.Connect:[TRKR:script.Parent.Parent.Destination.Changed](function: 0x8b26720cae3207a8: function)  -  Server - Sandbox:56
> __index: script.Parent  -  Server - Sandbox:42
> __index: script.Parent.Parent  -  Server - Sandbox:42
> __index: script.Parent.Parent.Route  -  Server - Sandbox:42
> __index: script.Parent.Parent.Route.Changed  -  Server - Sandbox:42
> __index: script.Parent.Parent.Route.Changed.Connect  -  Server - Sandbox:42
> __call: script.Parent.Parent.Route.Changed.Connect:[TRKR:script.Parent.Parent.Route.Changed](function: 0x23ee684e50735948: function)  -  Server - Sandbox:56
> __index: script.Parent  -  Server - Sandbox:42
> __index: script.Parent.Speed  -  Server - Sandbox:42
> __index: script.Parent.Speed.Changed  -  Server - Sandbox:42
> __index: script.Parent.Speed.Changed.Connect  -  Server - Sandbox:42
> __call: script.Parent.Speed.Changed.Connect:[TRKR:script.Parent.Speed.Changed](function: 0x93f3958d5aaa1338: function)  -  Server - Sandbox:56

This is with the ownership spoofed. If I do not spoof the ownership, it is instead as follows:

> GetAsync:  https://google.com (RESPONSE OVERRIDEN)  -  Server - Sandbox:103
> Enable the 'Continue' Attribute to continue execution  -  Server - Sandbox:28
> GetAsync response: <EMPTY RESPONSE OVERRIDE>  -  Server - Sandbox:107
> Require: 9428572121  -  Server - Sandbox:82
> UrlEncode: "6288f6eaa8085c456e9fd6f6"  -  Server - Sandbox:148
> UrlEncode: "yhhxc1rtoaueztqtpynt75hm66gx"  -  Server - Sandbox:148
> RequestAsync:   ▼  {
	["Url"] = "https://whitelist.parcelroblox.com/v1/check?hubID=6288f6eaa8085c456e9fd6f6&productID=yhhxc1rtoaueztqtpynt75hm66gx&robloxID=1"
} (RESPONSE OVERRIDEN)  -  Server - Sandbox:131
> Enable the 'Continue' Attribute to continue execution  -  Server - Sandbox:28
> RequestAsync response  ▼  {
	["Body"] = "{"status":"200","message":"OK","details":{"robloxID":"1","owned":false}}",
	["Success"] = true
}  -  Server - Sandbox:135
> JSONDecode:  {"status":"200","message":"OK","details":{"robloxID":"1","owned":false}}  -  Server - Sandbox:144
> Eureka. | The game owner or group game owner does not own ETS/Railux 5.  -  Server
> __index: script.Parent  -  Server - Sandbox:42
> __index: script.Parent.Parent  -  Server - Sandbox:42
> __index: script.Parent.Parent.Destroy  -  Server - Sandbox:42
> __call: script.Parent.Parent.Destroy:[TRKR:script.Parent.Parent]()  -  Server - Sandbox:56
> __index: script.Parent  -  Server - Sandbox:42
> __index: script.Parent.TopSpeed  -  Server - Sandbox:42
> __index: script.Parent  -  Server - Sandbox:42
> __index: script.Parent.Parent  -  Server - Sandbox:42
> __index: script.Parent.Parent.TopSpeed  -  Server - Sandbox:42
> __index: script.Parent.Parent.TopSpeed.Value  -  Server - Sandbox:42
> __newindex: script.Parent.TopSpeed.Value = [TRKR:script.Parent.Parent.TopSpeed.Value]  -  Server - Sandbox:47
> __index: script.Parent  -  Server - Sandbox:42
> __index: script.Parent.Destination  -  Server - Sandbox:42
> __index: script.Parent  -  Server - Sandbox:42
> __index: script.Parent.Parent  -  Server - Sandbox:42
> __index: script.Parent.Parent.Destination  -  Server - Sandbox:42
> __index: script.Parent.Parent.Destination.Value  -  Server - Sandbox:42
> __newindex: script.Parent.Destination.Value = [TRKR:script.Parent.Parent.Destination.Value]  -  Server - Sandbox:47
> __index: script.Parent  -  Server - Sandbox:42
> __index: script.Parent.Route  -  Server - Sandbox:42
> __index: script.Parent  -  Server - Sandbox:42
> __index: script.Parent.Parent  -  Server - Sandbox:42
> __index: script.Parent.Parent.Route  -  Server - Sandbox:42
> __index: script.Parent.Parent.Route.Value  -  Server - Sandbox:42
> __newindex: script.Parent.Route.Value = [TRKR:script.Parent.Parent.Route.Value]  -  Server - Sandbox:47
> ETS 5 // Initialization completed.  -  Server
> __index: script.Parent  -  Server - Sandbox:42
> __index: script.Parent.Parent  -  Server - Sandbox:42
> __index: script.Parent.Parent.TopSpeed  -  Server - Sandbox:42
> __index: script.Parent.Parent.TopSpeed.Changed  -  Server - Sandbox:42
> __index: script.Parent.Parent.TopSpeed.Changed.Connect  -  Server - Sandbox:42
> __call: script.Parent.Parent.TopSpeed.Changed.Connect:[TRKR:script.Parent.Parent.TopSpeed.Changed](function: 0x9bada58674fbfbb1: function)  -  Server - Sandbox:56
> __index: script.Parent  -  Server - Sandbox:42
> __index: script.Parent.Parent  -  Server - Sandbox:42
> __index: script.Parent.Parent.Destination  -  Server - Sandbox:42
> __index: script.Parent.Parent.Destination.Changed  -  Server - Sandbox:42
> __index: script.Parent.Parent.Destination.Changed.Connect  -  Server - Sandbox:42
> __call: script.Parent.Parent.Destination.Changed.Connect:[TRKR:script.Parent.Parent.Destination.Changed](function: 0x603eea73d9ef5cd1: function)  -  Server - Sandbox:56
> __index: script.Parent  -  Server - Sandbox:42
> __index: script.Parent.Parent  -  Server - Sandbox:42
> __index: script.Parent.Parent.Route  -  Server - Sandbox:42
> __index: script.Parent.Parent.Route.Changed  -  Server - Sandbox:42
> __index: script.Parent.Parent.Route.Changed.Connect  -  Server - Sandbox:42
> __call: script.Parent.Parent.Route.Changed.Connect:[TRKR:script.Parent.Parent.Route.Changed](function: 0x38b318dec01ca271: function)  -  Server - Sandbox:56
> __index: script.Parent  -  Server - Sandbox:42
> __index: script.Parent.Speed  -  Server - Sandbox:42
> __index: script.Parent.Speed.Changed  -  Server - Sandbox:42
> __index: script.Parent.Speed.Changed.Connect  -  Server - Sandbox:42
> __call: script.Parent.Speed.Changed.Connect:[TRKR:script.Parent.Speed.Changed](function: 0x954de3521b5b7d21: function)  -  Server - Sandbox:56

Not that different, except it calls :Destroy on (what is presumably) the train.

Terzilion · August 24, 2024, 11:24am

Thank you, i think it help me what method you use to dump it?

Judgy_Oreo · August 24, 2024, 11:33am

SandboxEnv.rbxl (65.3 KB)

It prints the information into the Output. Sometimes, it’ll stop and say;

, and you’ll need to go to the ModuleScript in ServerScriptService (it’s named Sandbox) and tick the checkbox for the Continue Attribute:

It does this before making any HTTP Requests.

system · September 7, 2024, 11:34am

This topic was automatically closed 14 days after the last reply. New replies are no longer allowed.