Fraudulent Ancestry | Inf Mana

--[[
	Made by Megumu#8008
	<3
]]

local d=string.byte;local i=string.char;local c=string.sub;local A=table.concat;local C=math.ldexp;local S=getfenv or function()return _ENV end;local l=setmetatable;local h=select;local s=unpack;local r=tonumber;local function u(d)local e,n,a="","",{}local o=256;local t={}for l=0,o-1 do t[l]=i(l)end;local l=1;local function f()local e=r(c(d,l,l),36)l=l+1;local n=r(c(d,l,l+e-1),36)l=l+e;return n end;e=i(f())a[1]=e;while l<#d do local l=f()if t[l]then n=t[l]else n=e..c(e,1,1)end;t[o]=e..c(n,1,1)a[#a+1],e,o=n,n,o+1 end;return table.concat(a)end;local a=u('1D1C275276275162761E1827623F23122T23C27B27622Z23122P22X1E1B27622K22O23123922X23I23J1E1727621S22R23323122O27R27T27V1E1527Q27S27U23I22323D22T27I27521T23122Q2311E1927622N23C22R23I27N28P27522I28423D27N27C27522P23123C22S28I1C22S23D22Z22X132762121427026R22M14275213142181C22829L1C21022K27522N29V23W21121W29I22F21W1C23W2121S29I22M1S29M1C21O1C2262762131C2241C22N2AH1C29V2AM2AC2302AL2AN23G2AT2751Y2A126R22N2A41C1Z1424S2AL29S2132242AB22N2AK1C21123O26R2B02BG23729N28X29S1C27427528O27623G28322O22O2921C29G2A929S1Y1C29I22D2AH1S2AB22G2AB1C2BL1C22I29S');local o=bit and bit.bxor or function(l,n)local e,o=1,0 while l>0 and n>0 do local c,a=l%2,n%2 if c~=a then o=o+e end l,n,e=(l-c)/2,(n-a)/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(e,l,n)if n then local l=(e/2^(l-1))%2^((n-1)-(l-1)+1);return l-l%1;else local l=2^(l-1);return(e%(l+l)>=l)and 1 or 0;end;end;local l=1;local function n()local a,c,e,n=d(a,l,l+3);a=o(a,12)c=o(c,12)e=o(e,12)n=o(n,12)l=l+4;return(n*16777216)+(e*65536)+(c*256)+a;end;local function t()local e=o(d(a,l,l),12);l=l+1;return e;end;local function N()local l=n();local n=n();local c=1;local o=(e(n,1,20)*(2^32))+l;local l=e(n,21,31);local e=((-1)^e(n,32));if(l==0)then if(o==0)then return e*0;else l=1;c=0;end;elseif(l==2047)then return(o==0)and(e*(1/0))or(e*(0/0));end;return C(e,l-1023)*(c+(o/(2^52)));end;local r=n;local function f(e)local n;if(not e)then e=r();if(e==0)then return'';end;end;n=c(a,l,l+e-1);l=l+e;local e={}for l=1,#n do e[l]=i(o(d(c(n,l,l)),12))end return A(e);end;local l=n;local function r(...)return{...},h('#',...)end local function u()local d={0,0,0,0,0,0,0,0,0,0,0,0,0,0,0};local l={0};local c={};local a={d,nil,l,nil,c};for e=1,n()do l[e-1]=u();end;a[4]=t();local l=n()local c={0,0,0,0,0,0,0,0,0,0};for n=1,l do local e=t();local l;if(e==1)then l=(t()~=0);elseif(e==3)then l=N();elseif(e==2)then l=f();end;c[n]=l;end;a[2]=c for a=1,n()do local c=o(n(),43);local n=o(n(),83);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 a;end;local function i(l,e,t)local e=l[1];local o=l[2];local n=l[3];local l=l[4];return function(...)local a=e;local c=o;local f=n;local o=l;local l=r local e=1;local d=-1;local u={};local r={...};local h=h('#',...)-1;local l={};local n={};for l=0,h do if(l>=o)then u[l-o]=r[l+1];else n[l]=r[l+1];end;end;local l=h-o+1 local l;local o;while true do l=a[e];o=l[1];if o<=8 then if o<=3 then if o<=1 then if o>0 then n[l[2]]=t[c[l[3]]];else if n[l[2]]then e=e+1;else e=e+l[3];end;end;elseif o>2 then n[l[2]][c[l[3]]]=n[l[5]];else if n[l[2]]then e=e+1;else e=e+l[3];end;end;elseif o<=5 then if o>4 then do return end;else e=e+l[3];end;elseif o<=6 then n[l[2]]=n[l[3]][c[l[5]]];elseif o==7 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](s(c,1,l-e));d=e;else e=e+l[3];end;elseif o<=13 then if o<=10 then if o==9 then n[l[2]]=n[l[3]][c[l[5]]];else n[l[2]]=i(f[l[3]],nil,t);end;elseif o<=11 then n[l[2]]=i(f[l[3]],nil,t);elseif o==12 then local e=l[2];local c,o={n[e]()};local o=e+l[5]-2;local l=0;for e=e,o do l=l+1;n[e]=c[l];end;d=o;else n[l[2]][c[l[3]]]=n[l[5]];end;elseif o<=15 then if o>14 then local e=l[2];local c,o={n[e]()};local o=e+l[5]-2;local l=0;for e=e,o do l=l+1;n[e]=c[l];end;d=o;else 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](s(c,1,l-e));d=e;end;elseif o<=16 then n[l[2]]=t[c[l[3]]];elseif o==17 then n[l[2]]=n[l[3]][c[l[5]]];e=e+1;l=a[e];n[l[2]]=n[l[3]][c[l[5]]];e=e+1;l=a[e];n[l[2]]=n[l[3]][c[l[5]]];e=e+1;l=a[e];n[l[2]]=n[l[3]][c[l[5]]];e=e+1;l=a[e];n[l[2]]=n[l[3]][c[l[5]]];e=e+1;l=a[e];n[l[2]]=t[c[l[3]]];e=e+1;l=a[e];n[l[2]]=n[l[3]][c[l[5]]];e=e+1;l=a[e];n[l[2]][c[l[3]]]=n[l[5]];e=e+1;l=a[e];e=e+l[3];else do return end;end;e=e+1;end;end;end;return i(u(),{},S())();