0% found this document useful (0 votes)
27 views

Message

Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
27 views

Message

Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 2

local t=string.byte;local r=string.char;local c=string.

sub;local
s=table.concat;local u=math.ldexp;local K=getfenv or function()return _ENV
end;local l=setmetatable;local i=select;local f=unpack;local h=tonumber;local
function M(t)local o,e,d="","",{}local n=256;local a={}for l=0,n-1 do
a[l]=r(l)end;local l=1;local function f()local o=h(c(t,l,l),36)l=l+1;local
e=h(c(t,l,l+o-1),36)l=l+o;return e end;o=r(f())d[1]=o;while l<#t do local l=f()if
a[l]then e=a[l]else e=o..c(o,1,1)end;a[n]=o..c(e,1,1)d[#d+1],o,n=e,e,n+1 end;return
table.concat(d)end;local
a=M('1G1K2751M1U2751K23C23F23923422V22O22U23H23E2371M27427523723923D2351M1J27922K22
O22O22S22B23522O1M21H27923G27W22S22V21A21N21N22S23927F23523A27I21M23B23F23D21N22U23
922R21N22523123A22H23123H21X2392792751S27921F1S26C26J26N2911K21J1429526M1427521I1S2
101K26M29821R21G29C21G29F1C27526M29R1K21E1K29P26M27921E1S29E29K2752A129S298');local
n=bit and bit.bxor or function(l,o)local e,n=1,0 while l>0 and o>0 do local a,c=l
%2,o%2 if a~=c then n=n+e end l,o,e=(l-a)/2,(o-c)/2,e*2 end if l<o then l=o end
while l>0 do local o=l%2 if o>0 then n=n+e end l,e=(l-o)/2,e*2 end return n end
local function l(o,l,e)if e then local l=(o/2^(l-1))%2^((e-1)-(l-1)+1);return l-l
%1;else local l=2^(l-1);return(o%(l+l)>=l)and 1 or 0;end;end;local o=1;local
function e()local
a,c,l,e=t(a,o,o+3);a=n(a,20)c=n(c,20)l=n(l,20)e=n(e,20)o=o+4;return(e*16777216)+
(l*65536)+(c*256)+a;end;local function d()local l=n(t(a,o,o),20);o=o+1;return
l;end;local function S()local o=e();local n=e();local c=1;local
e=(l(n,1,20)*(2^32))+o;local o=l(n,21,31);local l=((-1)^l(n,32));if(o==0)then
if(e==0)then return l*0;else o=1;c=0;end;elseif(o==2047)then
return(e==0)and(l*(1/0))or(l*(0/0));end;return u(l,o-1023)*(c+(e/(2^52)));end;local
h=e;local function M(l)local e;if(not l)then l=h();if(l==0)then
return'';end;end;e=c(a,o,o+l-1);o=o+l;local o={}for l=1,#e do
o[l]=r(n(t(c(e,l,l)),20))end return s(o);end;local o=e;local function
u(...)return{...},i('#',...)end local function b()local t={0,0,0,0,0,0,0,0};local
r={};local o={};local a={t,nil,r,nil,o};local o=e()local c={0,0,0,0};for e=1,o do
local o=d();local l;if(o==0)then l=(d()~=0);elseif(o==1)then l=S();elseif(o==2)then
l=M();end;c[e]=l;end;a[2]=c for l=1,e()do r[l-1]=b();end;a[4]=d();for a=1,e()do
local c=n(e(),38);local e=n(e(),250);local n=l(c,1,2);local o=l(e,1,11);local
o={o,l(c,3,11),nil,nil,e};if(n==0)then
o[3]=l(c,12,20);o[5]=l(c,21,29);elseif(n==1)then o[3]=l(e,12,33);elseif(n==2)then
o[3]=l(e,12,32)-1048575;elseif(n==3)then o[3]=l(e,12,32)-
1048575;o[5]=l(c,21,29);end;t[a]=o;end;return a;end;local function S(l,o,h)local
o=l[1];local e=l[2];local n=l[3];local l=l[4];return function(...)local r=o;local
t=e;local o=n;local n=l;local M=u local e=1;local d=-1;local u={};local
a={...};local c=i('#',...)-1;local l={};local o={};for l=0,c do if(l>=n)then u[l-
n]=a[l+1];else o[l]=a[l+1];end;end;local l=c-n+1 local l;local a;while true do
l=r[e];a=l[1];if a<=6 then if a<=2 then if a<=0 then o[l[2]]=t[l[3]];elseif a==1
then local n;local u,n;local a;local c;local i;local s;local
n;o[l[2]]=h[t[l[3]]];e=e+1;l=r[e];o[l[2]]=h[t[l[3]]];e=e+1;l=r[e];n=l[2];s=o[l[3]];
o[n+1]=s;o[n]=s[t[l[5]]];e=e+1;l=r[e];o[l[2]]=t[l[3]];e=e+1;l=r[e];n=l[2];i={};c=0;
a=n+l[3]-1;for l=n+1,a do c=c+1;i[c]=o[l];end;u,a=M(o[n](f(i,1,a-n)));a=a+n-
1;c=0;for l=n,a do c=c+1;o[l]=u[c];end;d=a;e=e+1;l=r[e];n=l[2];i={};c=0;a=d;for
l=n+1,a do c=c+1;i[c]=o[l];end;u={o[n](f(i,1,a-n))};a=n+l[5]-2;c=0;for l=n,a do
c=c+1;o[l]=u[c];end;d=a;e=e+1;l=r[e];o[l[2]]();d=n;e=e+1;l=r[e];do return end;else
o[l[2]]=t[l[3]];end;elseif a<=4 then if a>3 then do return end;else local
n=l[2];local c={};local e=0;local l=n+l[3]-1;for l=n+1,l do
e=e+1;c[e]=o[l];end;local c,l=M(o[n](f(c,1,l-n)));l=l+n-1;e=0;for l=n,l do
e=e+1;o[l]=c[e];end;d=l;end;elseif a>5 then local e=l[2];local
n=o[l[3]];o[e+1]=n;o[e]=n[t[l[5]]];else local n=l[2];local c={};local e=0;local
l=n+l[3]-1;for l=n+1,l do e=e+1;c[e]=o[l];end;local c,l=M(o[n](f(c,1,l-n)));l=l+n-
1;e=0;for l=n,l do e=e+1;o[l]=c[e];end;d=l;end;elseif a<=10 then if a<=8 then if
a==7 then o[l[2]]=h[t[l[3]]];else do return end;end;elseif a>9 then local
n=l[2];local a={};local e=0;local c=d;for l=n+1,c do e=e+1;a[e]=o[l];end;local
c={o[n](f(a,1,c-n))};local l=n+l[5]-2;e=0;for l=n,l do e=e+1;o[l]=c[e];end;d=l;else
local e=l[2];local n=o[l[3]];o[e+1]=n;o[e]=n[t[l[5]]];end;elseif a<=12 then if
a==11 then o[l[2]]();d=A;else o[l[2]]=h[t[l[3]]];end;elseif a==13 then o[l[2]]
();d=A;else local n=l[2];local a={};local e=0;local c=d;for l=n+1,c do
e=e+1;a[e]=o[l];end;local c={o[n](f(a,1,c-n))};local l=n+l[5]-2;e=0;for l=n,l do
e=e+1;o[l]=c[e];end;d=l;end;e=e+1;end;end;end;return S(b(),{},K())();

You might also like