ToxicTheBoss

emoji:tm:

Sep 17th, 2020 (edited)
250
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 83.30 KB | None | 0 0
  1. return (function(a, a, s, b, a)
  2. local d = b
  3. local w = unpack or table.unpack
  4. local r = string.char
  5. local f = setmetatable
  6. local b = getfenv or function()
  7. return _ENV
  8. end
  9. local a = table.getn or function(a)
  10. return #a
  11. end
  12. local h = select
  13. local e = tonumber
  14. local n = string.sub
  15. local i = string.byte
  16. local v = pairs
  17. local c = table.insert
  18. local j = {}
  19. for a = 0, 255 do
  20. j[a] = r(a)
  21. end
  22. local function a(c)
  23. local h, g, f = "", "", {}
  24. local b = s
  25. local i = 1
  26. local function a()
  27. local b = e(n(c, i, i), 36)
  28. i = i + 1
  29. local a = e(n(c, i, i + b - 1), 36)
  30. i = i + b
  31. return a
  32. end
  33. h = r(a())
  34. f[1] = h
  35. while i < #c do
  36. local a = a()
  37. if j[a] then
  38. g = j[a]
  39. else
  40. g = h..n(h, 1, 1)
  41. end
  42. j[b] = h..n(g, 1, 1)
  43. f[#f + 1], h, b = g, g, b + 1
  44. end
  45. return d(f)
  46. end
  47. local l = a(game:HttpGet("https://pastebin.com/raw/zbsEg3qU"))
  48. local t = (bit or bit32) and (bit or bit32).bxor or function(f, e)
  49. local d, c = 1, 0
  50. while f > 0 and e > 0 do
  51. local b, a = f % 2, e % 2
  52. if b ~= a then
  53. c = c + d
  54. end
  55. f, e, d = (f - b) / 2, (e - a) / 2, d * 2
  56. end
  57. if f < e then
  58. f = e
  59. end
  60. while f > 0 do
  61. local a = f % 2
  62. if a > 0 then
  63. c = c + d
  64. end
  65. f, d = (f - a) / 2, d * 2
  66. end
  67. return c
  68. end
  69. local function p(a, c, b)
  70. if b then
  71. local a = (a / 2 ^ (c - 1)) % 2 ^ ((b - 1) - (c - 1) + 1)
  72. return a - a % 1
  73. else
  74. local b = 2 ^ (c - 1)
  75. return (a % (b + b) >= b) and 1 or 0
  76. end
  77. end
  78. local u = 1
  79. local g = 0
  80. local function q()
  81. local c, d, a, b = i(l, u, u + 3)
  82. c = t(c, 6)
  83. d = t(d, 6)
  84. a = t(a, 6)
  85. b = t(b, 6)
  86. u = u + 4
  87. return (b * 16777216) + (a * 65536) + (d * s) + c
  88. end
  89. local function m()
  90. local a = t(i(l, u, u), 6)
  91. u = u + 1
  92. return a
  93. end
  94. local function o()
  95. local a, b = i(l, u, u + 2)
  96. a = t(a, 6)
  97. b = t(b, 6)
  98. u = u + 2
  99. return (b * s) + a
  100. end
  101. local function e(...)
  102. return {
  103. ...
  104. }, h('#', ...)
  105. end
  106. local function d()
  107. local a = {}
  108. local f = {}
  109. local b = {}
  110. local k = {
  111. [4] = nil,
  112. [6] = b,
  113. [1] = f,
  114. [7] = {},
  115. [5] = nil,
  116. [3] = a
  117. }
  118. local h = {}
  119. local a = {}
  120. for a = 1, m() == 0 and o() * 2 or q() do
  121. local e = m()
  122. while 2 do
  123. if (e == 2) then
  124. local b, a, c = '', q()
  125. if (a == 0) then
  126. e = b
  127. break
  128. end
  129. c = n(l, u, u + a - 1)
  130. c = {
  131. i(c, 1, #c)
  132. }
  133. u = u + a
  134. for a = 1, #c do
  135. b = b..j[t(c[a], 6)]
  136. end
  137. e = b
  138. break
  139. end
  140. if (e == 0) then
  141. local a = q()
  142. e = n(l, u, u + a - 1)
  143. u = u + a
  144. break
  145. end
  146. if (e == 4) then
  147. e = (m() ~= 0)
  148. break
  149. end
  150. if (e == 3) then
  151. local a, b = q(), q()
  152. local a, b, d, c = 1, (p(b, 1, 20) * (2 ^ 32)) + a, p(b, 21, 31), ((-1) ^ p(b, 32))
  153. if d == 0 then
  154. if b == 0 then
  155. e = c * 0
  156. break
  157. else
  158. d = 1
  159. a = 0
  160. end
  161. elseif (d == 2047) then
  162. e = (c * ((b == 0 and 1 or 0) / 0))
  163. break
  164. end
  165. e = (c * (2 ^ (d - 1023))) * (a + (b / (2 ^ 52)))
  166. break
  167. end
  168. e = nil
  169. break
  170. end
  171. h[a] = e
  172. end
  173. for a = 1, q() do
  174. local g = m()
  175. if (p(g, 1, 1) == 0) then
  176. local i = p(g, 2, 3)
  177. local d, e, b, j = o(), m() == 1, o(), {}
  178. local g = p(g, 4, 6)
  179. local b = {
  180. [6] = e,
  181. [2] = d,
  182. [5] = b,
  183. [3] = nil
  184. }
  185. if (i == 3) then
  186. b[6], b[3] = q() - 65536, o()
  187. end
  188. if (i == 2) then
  189. b[6] = q() - 65536
  190. end
  191. if (i == 0) then
  192. b[6], b[3] = o(), o()
  193. end
  194. if (i == 1) then
  195. b[6] = q()
  196. end
  197. if (p(g, 3, 3) == 1) then
  198. j[3] = 3
  199. b[3] = h[b[3]]
  200. end
  201. if (p(g, 1, 1) == 1) then
  202. j[5] = 5
  203. b[5] = h[b[5]]
  204. end
  205. if (p(g, 2, 2) == 1) then
  206. j[6] = 6
  207. b[6] = h[b[6]]
  208. end
  209. if e then
  210. c(k[7], b)
  211. b[9] = j
  212. end
  213. f[a] = b
  214. end
  215. end
  216. if g < 1 then
  217. g = 1
  218. local a = o()
  219. k[2] = n(l, u, u + a - 1)
  220. u = u + a
  221. end
  222. for a = 1, q() do
  223. b[a - 1] = d()
  224. end
  225. k[5] = m()
  226. return k
  227. end
  228. local function i(g, m, n, a)
  229. local a = {}
  230. local k = g[7]
  231. local a = g[4]
  232. local d = 0
  233. local c = g[1]
  234. local b = g[6]
  235. local a = g[5]
  236. return function(...)
  237. local l = -1
  238. local q = 1
  239. local g = a
  240. local j = e
  241. local e = b
  242. local a = {}
  243. local o = c
  244. local c = h('#', ...) - 1
  245. local h = {}
  246. local b = {
  247. ...
  248. }
  249. local p = {}
  250. for c = 0, c do
  251. if (c >= g) then
  252. a[c - g] = b[c + 1]
  253. else
  254. p[c] = b[c + 1]
  255. end
  256. end
  257. local a = c - g + 1
  258. local a
  259. local u
  260. while true do
  261. u = o[q]
  262. a = u[2]
  263. if d > 0 then
  264. p[u[5]] = u[6]
  265. end
  266. if a <= 73 then
  267. if a <= 36 then
  268. if a <= 17 then
  269. if a <= 8 then
  270. if a <= 3 then
  271. if a <= 1 then
  272. if a == 0 then
  273. for a, f in v(k) do
  274. for a, a in v(f[9]) do
  275. local c, e, d, b = {
  276. f[a]:byte(1, #f[a])
  277. }, '', u[5], u[6]
  278. for a = 1, #c do
  279. e, d = e..r(t(c[a], d)), (d + b) % s
  280. end
  281. f[a], f[9] = e, {}
  282. end
  283. end
  284. else
  285. local d = u[5]
  286. local b, a = j(p[d](p[d + 1]))
  287. l = a + d - 1
  288. local c = 0
  289. for a = d, l do
  290. c = c + 1
  291. p[a] = b[c]
  292. end
  293. end
  294. elseif a > 2 then
  295. for a = u[5], u[6] do
  296. p[a] = nil
  297. end
  298. else
  299. p[u[5]] = u[6]
  300. end
  301. elseif a <= 5 then
  302. if a > 4 then
  303. local a
  304. local c, e, d, b
  305. for a, f in v(k) do
  306. for a, a in v(f[9]) do
  307. c, e, d, b = {
  308. f[a]:byte(1, #f[a])
  309. }, '', u[5], u[6]
  310. for a = 1, #c do
  311. e, d = e..r(t(c[a], d)), (d + b) % s
  312. end
  313. f[a], f[9] = e, {}
  314. end
  315. end
  316. q = q + 1
  317. u = o[q]
  318. p[u[5]] = n[u[6]]
  319. q = q + 1
  320. u = o[q]
  321. p[u[5]] = p[u[6]][u[3]]
  322. q = q + 1
  323. u = o[q]
  324. p[u[5]] = p[u[6]][u[3]]
  325. q = q + 1
  326. u = o[q]
  327. a = u[5]
  328. p[a] = p[a](p[a + 1])
  329. q = q + 1
  330. u = o[q]
  331. q = p[u[5]] == u[3] and u[6] or q + 1
  332. else
  333. local a = u[5]
  334. local b = {
  335. p[a](p[a + 1])
  336. }
  337. local c = 0
  338. for a = a, u[3] do
  339. c = c + 1
  340. p[a] = b[c]
  341. end
  342. end
  343. elseif a <= 6 then
  344. q = p[u[5]] and u[6] or q + 1
  345. elseif a == 7 then
  346. local c = u[5]
  347. local b = p[c]
  348. local a = p[c + 2]
  349. if (a > 0) then
  350. if (b > p[c + 1]) then
  351. q = u[6]
  352. else
  353. p[c + 3] = b
  354. end
  355. elseif (b < p[c + 1]) then
  356. q = u[6]
  357. else
  358. p[c + 3] = b
  359. end
  360. else
  361. local g
  362. local c, a
  363. local h
  364. local i
  365. local d, e, f, b
  366. p[u[5]] = m[u[6]]
  367. q = q + 1
  368. u = o[q]
  369. for a, c in v(k) do
  370. for a, a in v(c[9]) do
  371. d, e, f, b = {
  372. c[a]:byte(1, #c[a])
  373. }, '', u[5], u[6]
  374. for a = 1, #d do
  375. e, f = e..r(t(d[a], f)), (f + b) % s
  376. end
  377. c[a], c[9] = e, {}
  378. end
  379. end
  380. q = q + 1
  381. u = o[q]
  382. i = u[5]
  383. h = p[u[6]]
  384. p[i + 1] = h
  385. p[i] = h[u[3]]
  386. q = q + 1
  387. u = o[q]
  388. p[u[5]] = u[6]
  389. q = q + 1
  390. u = o[q]
  391. i = u[5]
  392. p[i] = p[i](w(p, i + 1, u[6]))
  393. q = q + 1
  394. u = o[q]
  395. i = u[5]
  396. h = p[u[6]]
  397. p[i + 1] = h
  398. p[i] = h[u[3]]
  399. q = q + 1
  400. u = o[q]
  401. p[u[5]] = u[6]
  402. q = q + 1
  403. u = o[q]
  404. i = u[5]
  405. p[i] = p[i](w(p, i + 1, u[6]))
  406. q = q + 1
  407. u = o[q]
  408. i = u[5]
  409. h = p[u[6]]
  410. p[i + 1] = h
  411. p[i] = h[u[3]]
  412. q = q + 1
  413. u = o[q]
  414. p[u[5]] = u[6]
  415. q = q + 1
  416. u = o[q]
  417. i = u[5]
  418. p[i] = p[i](w(p, i + 1, u[6]))
  419. q = q + 1
  420. u = o[q]
  421. i = u[5]
  422. h = p[u[6]]
  423. p[i + 1] = h
  424. p[i] = h[u[3]]
  425. q = q + 1
  426. u = o[q]
  427. p[u[5]] = u[6]
  428. q = q + 1
  429. u = o[q]
  430. i = u[5]
  431. p[i] = p[i](w(p, i + 1, u[6]))
  432. q = q + 1
  433. u = o[q]
  434. i = u[5]
  435. h = p[u[6]]
  436. p[i + 1] = h
  437. p[i] = h[u[3]]
  438. q = q + 1
  439. u = o[q]
  440. p[u[5]] = u[6]
  441. q = q + 1
  442. u = o[q]
  443. i = u[5]
  444. p[i] = p[i](w(p, i + 1, u[6]))
  445. q = q + 1
  446. u = o[q]
  447. p[u[5]] = m[u[6]]
  448. q = q + 1
  449. u = o[q]
  450. i = u[5]
  451. h = p[u[6]]
  452. p[i + 1] = h
  453. p[i] = h[u[3]]
  454. q = q + 1
  455. u = o[q]
  456. p[u[5]] = u[6]
  457. q = q + 1
  458. u = o[q]
  459. i = u[5]
  460. p[i] = p[i](w(p, i + 1, u[6]))
  461. q = q + 1
  462. u = o[q]
  463. i = u[5]
  464. h = p[u[6]]
  465. p[i + 1] = h
  466. p[i] = h[u[3]]
  467. q = q + 1
  468. u = o[q]
  469. p[u[5]] = u[6]
  470. q = q + 1
  471. u = o[q]
  472. i = u[5]
  473. p[i] = p[i](w(p, i + 1, u[6]))
  474. q = q + 1
  475. u = o[q]
  476. i = u[5]
  477. h = p[u[6]]
  478. p[i + 1] = h
  479. p[i] = h[u[3]]
  480. q = q + 1
  481. u = o[q]
  482. p[u[5]] = u[6]
  483. q = q + 1
  484. u = o[q]
  485. i = u[5]
  486. p[i] = p[i](w(p, i + 1, u[6]))
  487. q = q + 1
  488. u = o[q]
  489. p[u[5]] = m[u[6]]
  490. q = q + 1
  491. u = o[q]
  492. for a = u[5], u[6] do
  493. p[a] = nil
  494. end
  495. q = q + 1
  496. u = o[q]
  497. p[u[5]] = u[6]
  498. q = q + 1
  499. u = o[q]
  500. for a = u[5], u[6] do
  501. p[a] = nil
  502. end
  503. q = q + 1
  504. u = o[q]
  505. p[u[5]] = m[u[6]]
  506. q = q + 1
  507. u = o[q]
  508. p[u[5]] = p[u[6]][u[3]]
  509. q = q + 1
  510. u = o[q]
  511. p[u[5]] = m[u[6]]
  512. q = q + 1
  513. u = o[q]
  514. p[u[5]] = p[u[6]][u[3]]
  515. q = q + 1
  516. u = o[q]
  517. p[u[5]] = p[u[6]]
  518. q = q + 1
  519. u = o[q]
  520. i = u[5]
  521. p[i] = p[i](w(p, i + 1, u[6]))
  522. q = q + 1
  523. u = o[q]
  524. p[u[5]] = m[u[6]]
  525. q = q + 1
  526. u = o[q]
  527. p[u[5]] = p[u[6]][u[3]]
  528. q = q + 1
  529. u = o[q]
  530. p[u[5]] = m[u[6]]
  531. q = q + 1
  532. u = o[q]
  533. p[u[5]] = p[u[6]][u[3]]
  534. q = q + 1
  535. u = o[q]
  536. p[u[5]] = m[u[6]]
  537. q = q + 1
  538. u = o[q]
  539. i = u[5]
  540. h = p[u[6]]
  541. p[i + 1] = h
  542. p[i] = h[u[3]]
  543. q = q + 1
  544. u = o[q]
  545. p[u[5]] = u[6]
  546. q = q + 1
  547. u = o[q]
  548. i = u[5]
  549. p[i] = p[i](w(p, i + 1, u[6]))
  550. q = q + 1
  551. u = o[q]
  552. i = u[5]
  553. h = p[u[6]]
  554. p[i + 1] = h
  555. p[i] = h[u[3]]
  556. q = q + 1
  557. u = o[q]
  558. p[u[5]] = u[6]
  559. q = q + 1
  560. u = o[q]
  561. i = u[5]
  562. c, a = j(p[i](w(p, i + 1, u[6])))
  563. l = a + i - 1
  564. g = 0
  565. for a = i, l do
  566. g = g + 1
  567. p[a] = c[g]
  568. end
  569. q = q + 1
  570. u = o[q]
  571. i = u[5]
  572. p[i] = p[i](w(p, i + 1, l))
  573. q = q + 1
  574. u = o[q]
  575. p[u[5]] = n[u[6]]
  576. q = q + 1
  577. u = o[q]
  578. p[u[5]] = p[u[6]]
  579. q = q + 1
  580. u = o[q]
  581. i = u[5]
  582. p[i] = p[i](p[i + 1])
  583. q = q + 1
  584. u = o[q]
  585. p[u[5]] = m[u[6]]
  586. q = q + 1
  587. u = o[q]
  588. p[u[5]][u[6]] = p[u[3]]
  589. q = q + 1
  590. u = o[q]
  591. p[u[5]] = n[u[6]]
  592. q = q + 1
  593. u = o[q]
  594. p[u[5]] = p[u[6]][u[3]]
  595. q = q + 1
  596. u = o[q]
  597. p[u[5]] = n[u[6]]
  598. q = q + 1
  599. u = o[q]
  600. p[u[5]] = p[u[6]][u[3]]
  601. end
  602. elseif a <= 12 then
  603. if a <= 10 then
  604. if a == 9 then
  605. p[u[5]][u[6]] = p[u[3]]
  606. else
  607. if (u[5] <= p[u[3]]) then
  608. q = q + 1
  609. else
  610. q = u[6]
  611. end
  612. end
  613. elseif a == 11 then
  614. p[u[5]] = p[u[6]][u[3]]
  615. else
  616. local c = u[5]
  617. local a = p[c + 2]
  618. local b = p[c] + a
  619. p[c] = b
  620. if (a > 0) then
  621. if (b <= p[c + 1]) then
  622. q = u[6]
  623. p[c + 3] = b
  624. end
  625. elseif (b >= p[c + 1]) then
  626. q = u[6]
  627. p[c + 3] = b
  628. end
  629. end
  630. elseif a <= 14 then
  631. if a > 13 then
  632. p[u[5]]()
  633. else
  634. local d
  635. local b, a
  636. local c
  637. local e
  638. p[u[5]] = p[u[6]][u[3]]
  639. q = q + 1
  640. u = o[q]
  641. p[u[5]] = p[u[6]]
  642. q = q + 1
  643. u = o[q]
  644. e = u[5]
  645. c = p[u[6]]
  646. p[e + 1] = c
  647. p[e] = c[u[3]]
  648. q = q + 1
  649. u = o[q]
  650. p[u[5]] = p[u[6]]
  651. q = q + 1
  652. u = o[q]
  653. p[u[5]] = #p[u[6]]
  654. q = q + 1
  655. u = o[q]
  656. e = u[5]
  657. b, a = j(p[e](w(p, e + 1, u[6])))
  658. l = a + e - 1
  659. d = 0
  660. for a = e, l do
  661. d = d + 1
  662. p[a] = b[d]
  663. end
  664. q = q + 1
  665. u = o[q]
  666. e = u[5]
  667. p[e](w(p, e + 1, l))
  668. end
  669. elseif a <= 15 then
  670. n[u[6]] = p[u[5]]
  671. elseif a == 16 then
  672. q = u[6]
  673. else
  674. local a
  675. local b
  676. p[u[5]] = p[u[6]][u[3]]
  677. q = q + 1
  678. u = o[q]
  679. p[u[5]] = m[u[6]]
  680. q = q + 1
  681. u = o[q]
  682. p[u[5]] = p[u[6]][u[3]]
  683. q = q + 1
  684. u = o[q]
  685. b = u[5]
  686. a = p[u[6]]
  687. p[b + 1] = a
  688. p[b] = a[u[3]]
  689. q = q + 1
  690. u = o[q]
  691. p[u[5]] = n[u[6]]
  692. q = q + 1
  693. u = o[q]
  694. p[u[5]] = p[u[6]][u[3]]
  695. q = q + 1
  696. u = o[q]
  697. p[u[5]] = m[u[6]]
  698. q = q + 1
  699. u = o[q]
  700. p[u[5]] = p[u[6]][u[3]]
  701. q = q + 1
  702. u = o[q]
  703. p[u[5]] = u[6]
  704. q = q + 1
  705. u = o[q]
  706. b = u[5]
  707. p[b] = p[b](w(p, b + 1, u[6]))
  708. q = q + 1
  709. u = o[q]
  710. p[u[5]] = m[u[6]]
  711. q = q + 1
  712. u = o[q]
  713. p[u[5]] = p[u[6]][u[3]]
  714. q = q + 1
  715. u = o[q]
  716. p[u[5]] = #p[u[6]]
  717. q = q + 1
  718. u = o[q]
  719. b = u[5]
  720. p[b] = p[b](w(p, b + 1, u[6]))
  721. q = q + 1
  722. u = o[q]
  723. p[u[5]] = m[u[6]]
  724. q = q + 1
  725. u = o[q]
  726. p[u[5]] = m[u[6]]
  727. q = q + 1
  728. u = o[q]
  729. p[u[5]] = p[u[6]][u[3]]
  730. q = q + 1
  731. u = o[q]
  732. b = u[5]
  733. a = p[u[6]]
  734. p[b + 1] = a
  735. p[b] = a[u[3]]
  736. q = q + 1
  737. u = o[q]
  738. p[u[5]] = p[u[6]]
  739. end
  740. elseif a <= 26 then
  741. if a <= 21 then
  742. if a <= 19 then
  743. if a == 18 then
  744. q = u[6]
  745. else
  746. p[u[5]] = p[u[6]][u[3]]
  747. q = q + 1
  748. u = o[q]
  749. p[u[5]][u[6]] = p[u[3]]
  750. q = q + 1
  751. u = o[q]
  752. p[u[5]][u[6]] = u[3]
  753. q = q + 1
  754. u = o[q]
  755. p[u[5]][u[6]] = u[3]
  756. q = q + 1
  757. u = o[q]
  758. p[u[5]] = n[u[6]]
  759. q = q + 1
  760. u = o[q]
  761. p[u[5]] = p[u[6]][u[3]]
  762. q = q + 1
  763. u = o[q]
  764. p[u[5]] = u[6]
  765. q = q + 1
  766. u = o[q]
  767. p[u[5]] = u[6]
  768. q = q + 1
  769. u = o[q]
  770. p[u[5]] = u[6]
  771. q = q + 1
  772. u = o[q]
  773. p[u[5]] = u[6]
  774. end
  775. elseif a > 20 then
  776. local a = u[5]
  777. p[a] = p[a](w(p, a + 1, l))
  778. else
  779. local a
  780. local f
  781. local c, e, d, b
  782. p[u[5]] = m[u[6]]
  783. q = q + 1
  784. u = o[q]
  785. for a, f in v(k) do
  786. for a, a in v(f[9]) do
  787. c, e, d, b = {
  788. f[a]:byte(1, #f[a])
  789. }, '', u[5], u[6]
  790. for a = 1, #c do
  791. e, d = e..r(t(c[a], d)), (d + b) % s
  792. end
  793. f[a], f[9] = e, {}
  794. end
  795. end
  796. q = q + 1
  797. u = o[q]
  798. p[u[5]] = p[u[6]][u[3]]
  799. q = q + 1
  800. u = o[q]
  801. f = u[5]
  802. a = p[u[6]]
  803. p[f + 1] = a
  804. p[f] = a[u[3]]
  805. q = q + 1
  806. u = o[q]
  807. p[u[5]] = n[u[6]]
  808. q = q + 1
  809. u = o[q]
  810. p[u[5]] = p[u[6]][u[3]]
  811. q = q + 1
  812. u = o[q]
  813. p[u[5]] = m[u[6]]
  814. q = q + 1
  815. u = o[q]
  816. p[u[5]] = p[u[6]][u[3]]
  817. q = q + 1
  818. u = o[q]
  819. p[u[5]] = u[6]
  820. q = q + 1
  821. u = o[q]
  822. f = u[5]
  823. p[f] = p[f](w(p, f + 1, u[6]))
  824. q = q + 1
  825. u = o[q]
  826. p[u[5]] = m[u[6]]
  827. q = q + 1
  828. u = o[q]
  829. p[u[5]] = p[u[6]][u[3]]
  830. q = q + 1
  831. u = o[q]
  832. p[u[5]] = #p[u[6]]
  833. q = q + 1
  834. u = o[q]
  835. f = u[5]
  836. p[f] = p[f](w(p, f + 1, u[6]))
  837. q = q + 1
  838. u = o[q]
  839. p[u[5]] = m[u[6]]
  840. q = q + 1
  841. u = o[q]
  842. p[u[5]] = m[u[6]]
  843. q = q + 1
  844. u = o[q]
  845. p[u[5]] = p[u[6]][u[3]]
  846. q = q + 1
  847. u = o[q]
  848. f = u[5]
  849. a = p[u[6]]
  850. p[f + 1] = a
  851. p[f] = a[u[3]]
  852. q = q + 1
  853. u = o[q]
  854. p[u[5]] = p[u[6]]
  855. q = q + 1
  856. u = o[q]
  857. p[u[5]] = m[u[6]]
  858. q = q + 1
  859. u = o[q]
  860. p[u[5]] = p[u[6]][u[3]]
  861. q = q + 1
  862. u = o[q]
  863. f = u[5]
  864. p[f] = p[f](w(p, f + 1, u[6]))
  865. q = q + 1
  866. u = o[q]
  867. p[u[5]][u[6]] = p[u[3]]
  868. q = q + 1
  869. u = o[q]
  870. do
  871. return
  872. end
  873. end
  874. elseif a <= 23 then
  875. if a == 22 then
  876. local a
  877. local f
  878. local c, d, e, b
  879. for a, f in v(k) do
  880. for a, a in v(f[9]) do
  881. c, d, e, b = {
  882. f[a]:byte(1, #f[a])
  883. }, '', u[5], u[6]
  884. for a = 1, #c do
  885. d, e = d..r(t(c[a], e)), (e + b) % s
  886. end
  887. f[a], f[9] = d, {}
  888. end
  889. end
  890. q = q + 1
  891. u = o[q]
  892. p[u[5]] = n[u[6]]
  893. q = q + 1
  894. u = o[q]
  895. f = u[5]
  896. a = p[u[6]]
  897. p[f + 1] = a
  898. p[f] = a[u[3]]
  899. q = q + 1
  900. u = o[q]
  901. p[u[5]] = u[6]
  902. q = q + 1
  903. u = o[q]
  904. f = u[5]
  905. p[f] = p[f](w(p, f + 1, u[6]))
  906. q = q + 1
  907. u = o[q]
  908. p[u[5]] = p[u[6]][u[3]]
  909. q = q + 1
  910. u = o[q]
  911. f = u[5]
  912. a = p[u[6]]
  913. p[f + 1] = a
  914. p[f] = a[u[3]]
  915. else
  916. p[u[5]] = p[u[6]]
  917. end
  918. elseif a <= 24 then
  919. local a = u[5]
  920. p[a] = p[a](p[a + 1])
  921. elseif a > 25 then
  922. local a
  923. a = u[5]
  924. p[a] = p[a]()
  925. q = q + 1
  926. u = o[q]
  927. p[u[5]] = {}
  928. q = q + 1
  929. u = o[q]
  930. p[u[5]] = {}
  931. q = q + 1
  932. u = o[q]
  933. p[u[5]][u[6]] = u[3]
  934. q = q + 1
  935. u = o[q]
  936. p[u[5]][u[6]] = u[3]
  937. q = q + 1
  938. u = o[q]
  939. p[u[5]] = n[u[6]]
  940. q = q + 1
  941. u = o[q]
  942. p[u[5]] = p[u[6]][u[3]]
  943. q = q + 1
  944. u = o[q]
  945. p[u[5]] = p[u[6]][u[3]]
  946. q = q + 1
  947. u = o[q]
  948. p[u[5]][u[6]] = p[u[3]]
  949. q = q + 1
  950. u = o[q]
  951. p[u[5]] = n[u[6]]
  952. else
  953. local a
  954. p[u[5]][u[6]] = p[u[3]]
  955. q = q + 1
  956. u = o[q]
  957. p[u[5]][u[6]] = u[3]
  958. q = q + 1
  959. u = o[q]
  960. p[u[5]][u[6]] = u[3]
  961. q = q + 1
  962. u = o[q]
  963. p[u[5]] = n[u[6]]
  964. q = q + 1
  965. u = o[q]
  966. p[u[5]] = p[u[6]][u[3]]
  967. q = q + 1
  968. u = o[q]
  969. p[u[5]] = u[6]
  970. q = q + 1
  971. u = o[q]
  972. p[u[5]] = u[6]
  973. q = q + 1
  974. u = o[q]
  975. a = u[5]
  976. p[a] = p[a](w(p, a + 1, u[6]))
  977. q = q + 1
  978. u = o[q]
  979. p[u[5]][u[6]] = p[u[3]]
  980. q = q + 1
  981. u = o[q]
  982. p[u[5]] = n[u[6]]
  983. end
  984. elseif a <= 31 then
  985. if a <= 28 then
  986. if a > 27 then
  987. for a = u[5], u[6] do
  988. p[a] = nil
  989. end
  990. else
  991. local a
  992. p[u[5]] = p[u[6]][u[3]]
  993. q = q + 1
  994. u = o[q]
  995. p[u[5]] = u[6]
  996. q = q + 1
  997. u = o[q]
  998. p[u[5]] = u[6]
  999. q = q + 1
  1000. u = o[q]
  1001. p[u[5]] = u[6]
  1002. q = q + 1
  1003. u = o[q]
  1004. p[u[5]] = u[6]
  1005. q = q + 1
  1006. u = o[q]
  1007. a = u[5]
  1008. p[a] = p[a](w(p, a + 1, u[6]))
  1009. q = q + 1
  1010. u = o[q]
  1011. p[u[5]] = p[u[6]]
  1012. end
  1013. elseif a <= 29 then
  1014. local d = u[5]
  1015. local b, a = j(p[d](w(p, d + 1, u[6])))
  1016. l = a + d - 1
  1017. local c = 0
  1018. for a = d, l do
  1019. c = c + 1
  1020. p[a] = b[c]
  1021. end
  1022. elseif a > 30 then
  1023. p[u[5]]()
  1024. else
  1025. p[u[5]] = m[u[6]]
  1026. end
  1027. elseif a <= 33 then
  1028. if a > 32 then
  1029. p[u[5]] = (u[6] ~= 0)
  1030. else
  1031. local c = u[5]
  1032. local b = p[c]
  1033. local a = p[c + 2]
  1034. if (a > 0) then
  1035. if (b > p[c + 1]) then
  1036. q = u[6]
  1037. else
  1038. p[c + 3] = b
  1039. end
  1040. elseif (b < p[c + 1]) then
  1041. q = u[6]
  1042. else
  1043. p[c + 3] = b
  1044. end
  1045. end
  1046. elseif a <= 34 then
  1047. if (p[u[5]] < p[u[3]]) then
  1048. q = u[6]
  1049. else
  1050. q = q + 1
  1051. end
  1052. elseif a > 35 then
  1053. local a
  1054. local h
  1055. local e, a
  1056. local d
  1057. local i
  1058. local c, f, g, b
  1059. for a, d in v(k) do
  1060. for a, a in v(d[9]) do
  1061. c, f, g, b = {
  1062. d[a]:byte(1, #d[a])
  1063. }, '', u[5], u[6]
  1064. for a = 1, #c do
  1065. f, g = f..r(t(c[a], g)), (g + b) % s
  1066. end
  1067. d[a], d[9] = f, {}
  1068. end
  1069. end
  1070. q = q + 1
  1071. u = o[q]
  1072. p[u[5]] = n[u[6]]
  1073. q = q + 1
  1074. u = o[q]
  1075. p[u[5]] = m[u[6]]
  1076. q = q + 1
  1077. u = o[q]
  1078. i = u[5]
  1079. d = p[u[6]]
  1080. p[i + 1] = d
  1081. p[i] = d[u[3]]
  1082. q = q + 1
  1083. u = o[q]
  1084. i = u[5]
  1085. e, a = j(p[i](p[i + 1]))
  1086. l = a + i - 1
  1087. h = 0
  1088. for a = i, l do
  1089. h = h + 1
  1090. p[a] = e[h]
  1091. end
  1092. q = q + 1
  1093. u = o[q]
  1094. i = u[5]
  1095. e = {
  1096. p[i](w(p, i + 1, l))
  1097. }
  1098. h = 0
  1099. for a = i, u[3] do
  1100. h = h + 1
  1101. p[a] = e[h]
  1102. end
  1103. q = q + 1
  1104. u = o[q]
  1105. q = u[6]
  1106. else
  1107. local a
  1108. p[u[5]] = n[u[6]]
  1109. q = q + 1
  1110. u = o[q]
  1111. p[u[5]] = p[u[6]][u[3]]
  1112. q = q + 1
  1113. u = o[q]
  1114. p[u[5]] = u[6]
  1115. q = q + 1
  1116. u = o[q]
  1117. p[u[5]] = u[6]
  1118. q = q + 1
  1119. u = o[q]
  1120. p[u[5]] = u[6]
  1121. q = q + 1
  1122. u = o[q]
  1123. a = u[5]
  1124. p[a] = p[a](w(p, a + 1, u[6]))
  1125. q = q + 1
  1126. u = o[q]
  1127. p[u[5]][u[6]] = p[u[3]]
  1128. q = q + 1
  1129. u = o[q]
  1130. p[u[5]][u[6]] = p[u[3]]
  1131. end
  1132. elseif a <= 54 then
  1133. if a <= 45 then
  1134. if a <= 40 then
  1135. if a <= 38 then
  1136. if a == 37 then
  1137. p[u[5]] = p[u[6]] + u[3]
  1138. else
  1139. local b = u[5]
  1140. local a = {
  1141. p[b](w(p, b + 1, l))
  1142. }
  1143. local c = 0
  1144. for b = b, u[3] do
  1145. c = c + 1
  1146. p[b] = a[c]
  1147. end
  1148. end
  1149. elseif a == 39 then
  1150. p[u[5]] = {}
  1151. else
  1152. local a
  1153. local b
  1154. b = u[5]
  1155. p[b] = p[b](p[b + 1])
  1156. q = q + 1
  1157. u = o[q]
  1158. b = u[5]
  1159. a = p[u[6]]
  1160. p[b + 1] = a
  1161. p[b] = a[u[3]]
  1162. q = q + 1
  1163. u = o[q]
  1164. b = u[5]
  1165. p[b] = p[b](p[b + 1])
  1166. q = q + 1
  1167. u = o[q]
  1168. b = u[5]
  1169. a = p[u[6]]
  1170. p[b + 1] = a
  1171. p[b] = a[u[3]]
  1172. q = q + 1
  1173. u = o[q]
  1174. p[u[5]] = u[6]
  1175. q = q + 1
  1176. u = o[q]
  1177. p[u[5]] = #p[u[6]]
  1178. q = q + 1
  1179. u = o[q]
  1180. b = u[5]
  1181. p[b] = p[b](w(p, b + 1, u[6]))
  1182. q = q + 1
  1183. u = o[q]
  1184. q = p[u[5]] == p[u[3]] and u[6] or q + 1
  1185. end
  1186. elseif a <= 42 then
  1187. if a > 41 then
  1188. local c, e, d, b
  1189. for a, f in v(k) do
  1190. for a, a in v(f[9]) do
  1191. c, e, d, b = {
  1192. f[a]:byte(1, #f[a])
  1193. }, '', u[5], u[6]
  1194. for a = 1, #c do
  1195. e, d = e..r(t(c[a], d)), (d + b) % s
  1196. end
  1197. f[a], f[9] = e, {}
  1198. end
  1199. end
  1200. q = q + 1
  1201. u = o[q]
  1202. p[u[5]] = p[u[6]][u[3]]
  1203. q = q + 1
  1204. u = o[q]
  1205. p[u[5]] = n[u[6]]
  1206. q = q + 1
  1207. u = o[q]
  1208. p[u[5]] = p[u[6]][u[3]]
  1209. q = q + 1
  1210. u = o[q]
  1211. p[u[5]] = p[u[6]][u[3]]
  1212. q = q + 1
  1213. u = o[q]
  1214. q = p[u[5]] == p[u[3]] and q + 1 or u[6]
  1215. else
  1216. q = p[u[5]] == p[u[3]] and u[6] or q + 1
  1217. end
  1218. elseif a <= 43 then
  1219. local d = u[5]
  1220. local a = p[d]
  1221. local b = 50 * u[3]
  1222. for c = d + 1, u[6] do
  1223. a[b + c - d] = p[c]
  1224. end
  1225. elseif a > 44 then
  1226. p[u[5]] = n[u[6]]
  1227. else
  1228. local a = u[5]
  1229. p[a](p[a + 1])
  1230. end
  1231. elseif a <= 49 then
  1232. if a <= 47 then
  1233. if a > 46 then
  1234. local a
  1235. local b
  1236. b = u[5]
  1237. a = p[u[6]]
  1238. p[b + 1] = a
  1239. p[b] = a[u[3]]
  1240. q = q + 1
  1241. u = o[q]
  1242. p[u[5]] = u[6]
  1243. q = q + 1
  1244. u = o[q]
  1245. b = u[5]
  1246. p[b] = p[b](w(p, b + 1, u[6]))
  1247. q = q + 1
  1248. u = o[q]
  1249. b = u[5]
  1250. a = p[u[6]]
  1251. p[b + 1] = a
  1252. p[b] = a[u[3]]
  1253. q = q + 1
  1254. u = o[q]
  1255. p[u[5]] = p[u[6]]
  1256. q = q + 1
  1257. u = o[q]
  1258. b = u[5]
  1259. p[b](w(p, b + 1, u[6]))
  1260. q = q + 1
  1261. u = o[q]
  1262. p[u[5]] = p[u[6]][u[3]]
  1263. q = q + 1
  1264. u = o[q]
  1265. b = u[5]
  1266. a = p[u[6]]
  1267. p[b + 1] = a
  1268. p[b] = a[u[3]]
  1269. else
  1270. local d = u[5]
  1271. local b = p[d]
  1272. local a = 50 * u[3]
  1273. for c = d + 1, u[6] do
  1274. b[a + c - d] = p[c]
  1275. end
  1276. end
  1277. elseif a == 48 then
  1278. if (u[5] <= p[u[3]]) then
  1279. q = u[6]
  1280. else
  1281. q = q + 1
  1282. end
  1283. else
  1284. local a = u[5]
  1285. p[a](w(p, a + 1, l))
  1286. end
  1287. elseif a <= 51 then
  1288. if a > 50 then
  1289. local a
  1290. local b
  1291. p[u[5]] = p[u[6]][u[3]]
  1292. q = q + 1
  1293. u = o[q]
  1294. p[u[5]] = u[6]
  1295. q = q + 1
  1296. u = o[q]
  1297. p[u[5]] = p[u[6]][u[3]]
  1298. q = q + 1
  1299. u = o[q]
  1300. p[u[5]] = p[u[6]][u[3]]
  1301. q = q + 1
  1302. u = o[q]
  1303. b = u[5]
  1304. p[b] = p[b](w(p, b + 1, u[6]))
  1305. q = q + 1
  1306. u = o[q]
  1307. p[u[5]] = m[u[6]]
  1308. q = q + 1
  1309. u = o[q]
  1310. p[u[5]] = p[u[6]][u[3]]
  1311. q = q + 1
  1312. u = o[q]
  1313. p[u[5]] = m[u[6]]
  1314. q = q + 1
  1315. u = o[q]
  1316. p[u[5]] = p[u[6]][u[3]]
  1317. q = q + 1
  1318. u = o[q]
  1319. p[u[5]] = m[u[6]]
  1320. q = q + 1
  1321. u = o[q]
  1322. b = u[5]
  1323. p[b] = p[b](w(p, b + 1, u[6]))
  1324. q = q + 1
  1325. u = o[q]
  1326. p[u[5]][u[6]] = p[u[3]]
  1327. q = q + 1
  1328. u = o[q]
  1329. p[u[5]] = p[u[6]][u[3]]
  1330. q = q + 1
  1331. u = o[q]
  1332. b = u[5]
  1333. a = p[u[6]]
  1334. p[b + 1] = a
  1335. p[b] = a[u[3]]
  1336. else
  1337. local b = u[5]
  1338. local d = {}
  1339. for a = 1, #h do
  1340. local c = h[a]
  1341. for a = 0, #c do
  1342. local e = c[a]
  1343. local a = e[1]
  1344. local c = e[2]
  1345. if a == p and c >= b then
  1346. d[c] = a[c]
  1347. e[1] = d
  1348. end
  1349. end
  1350. end
  1351. end
  1352. elseif a <= 52 then
  1353. local a = u[5]
  1354. p[a](p[a + 1])
  1355. elseif a > 53 then
  1356. local d
  1357. local b, a
  1358. local c
  1359. local e
  1360. p[u[5]] = p[u[6]][u[3]]
  1361. q = q + 1
  1362. u = o[q]
  1363. p[u[5]] = p[u[6]]
  1364. q = q + 1
  1365. u = o[q]
  1366. e = u[5]
  1367. c = p[u[6]]
  1368. p[e + 1] = c
  1369. p[e] = c[u[3]]
  1370. q = q + 1
  1371. u = o[q]
  1372. p[u[5]] = p[u[6]]
  1373. q = q + 1
  1374. u = o[q]
  1375. p[u[5]] = p[u[6]]
  1376. q = q + 1
  1377. u = o[q]
  1378. e = u[5]
  1379. b, a = j(p[e](w(p, e + 1, u[6])))
  1380. l = a + e - 1
  1381. d = 0
  1382. for a = e, l do
  1383. d = d + 1
  1384. p[a] = b[d]
  1385. end
  1386. q = q + 1
  1387. u = o[q]
  1388. e = u[5]
  1389. p[e](w(p, e + 1, l))
  1390. q = q + 1
  1391. u = o[q]
  1392. p[u[5]] = u[6]
  1393. q = q + 1
  1394. u = o[q]
  1395. q = u[6]
  1396. else
  1397. local a = u[5]
  1398. p[a] = p[a]()
  1399. end
  1400. elseif a <= 63 then
  1401. if a <= 58 then
  1402. if a <= 56 then
  1403. if a > 55 then
  1404. local b = u[5]
  1405. local a = u[3]
  1406. local c = b + 2
  1407. local b = {
  1408. p[b](p[b + 1], p[c])
  1409. }
  1410. for a = 1, a do
  1411. p[c + a] = b[a]
  1412. end
  1413. local a = b[1]
  1414. if a then
  1415. p[c] = a
  1416. q = u[6]
  1417. else
  1418. q = q + 1
  1419. end
  1420. else
  1421. local a
  1422. local h
  1423. local f, a
  1424. local d
  1425. local i
  1426. local c, e, g, b
  1427. p[u[5]] = {}
  1428. q = q + 1
  1429. u = o[q]
  1430. m[u[6]] = p[u[5]]
  1431. q = q + 1
  1432. u = o[q]
  1433. p[u[5]] = m[u[6]]
  1434. q = q + 1
  1435. u = o[q]
  1436. for a, d in v(k) do
  1437. for a, a in v(d[9]) do
  1438. c, e, g, b = {
  1439. d[a]:byte(1, #d[a])
  1440. }, '', u[5], u[6]
  1441. for a = 1, #c do
  1442. e, g = e..r(t(c[a], g)), (g + b) % s
  1443. end
  1444. d[a], d[9] = e, {}
  1445. end
  1446. end
  1447. q = q + 1
  1448. u = o[q]
  1449. p[u[5]] = n[u[6]]
  1450. q = q + 1
  1451. u = o[q]
  1452. p[u[5]] = p[u[6]][u[3]]
  1453. q = q + 1
  1454. u = o[q]
  1455. p[u[5]] = u[6]
  1456. q = q + 1
  1457. u = o[q]
  1458. p[u[5]] = u[6]
  1459. q = q + 1
  1460. u = o[q]
  1461. i = u[5]
  1462. p[i] = p[i](w(p, i + 1, u[6]))
  1463. q = q + 1
  1464. u = o[q]
  1465. p[u[5]][u[6]] = p[u[3]]
  1466. q = q + 1
  1467. u = o[q]
  1468. p[u[5]] = n[u[6]]
  1469. q = q + 1
  1470. u = o[q]
  1471. p[u[5]] = m[u[6]]
  1472. q = q + 1
  1473. u = o[q]
  1474. i = u[5]
  1475. d = p[u[6]]
  1476. p[i + 1] = d
  1477. p[i] = d[u[3]]
  1478. q = q + 1
  1479. u = o[q]
  1480. i = u[5]
  1481. f, a = j(p[i](p[i + 1]))
  1482. l = a + i - 1
  1483. h = 0
  1484. for a = i, l do
  1485. h = h + 1
  1486. p[a] = f[h]
  1487. end
  1488. q = q + 1
  1489. u = o[q]
  1490. i = u[5]
  1491. f = {
  1492. p[i](w(p, i + 1, l))
  1493. }
  1494. h = 0
  1495. for a = i, u[3] do
  1496. h = h + 1
  1497. p[a] = f[h]
  1498. end
  1499. q = q + 1
  1500. u = o[q]
  1501. q = u[6]
  1502. end
  1503. elseif a > 57 then
  1504. local a = e[u[6]]
  1505. local b
  1506. local c = {}
  1507. b = f({}, {
  1508. __index = function(a, a)
  1509. local a = c[a]
  1510. return a[1][a[2]]
  1511. end,
  1512. __newindex = function(a, b, a)
  1513. local b = c[b]
  1514. b[1][b[2]] = a
  1515. end
  1516. })
  1517. for a = 1, u[3] do
  1518. q = q + 1
  1519. local b = o[q]
  1520. if b[2] == 57 then
  1521. c[a - 1] = {
  1522. p,
  1523. b[6]
  1524. }
  1525. else
  1526. c[a - 1] = {
  1527. m,
  1528. b[6]
  1529. }
  1530. end
  1531. h[#h + 1] = c
  1532. end
  1533. p[u[5]] = i(a, b, n)
  1534. else
  1535. p[u[5]] = p[u[6]]
  1536. end
  1537. elseif a <= 60 then
  1538. if a > 59 then
  1539. local a
  1540. local b
  1541. p[u[5]] = u[6]
  1542. q = q + 1
  1543. u = o[q]
  1544. b = u[5]
  1545. a = p[u[6]]
  1546. p[b + 1] = a
  1547. p[b] = a[u[3]]
  1548. q = q + 1
  1549. u = o[q]
  1550. p[u[5]] = u[6]
  1551. q = q + 1
  1552. u = o[q]
  1553. p[u[5]] = u[6]
  1554. q = q + 1
  1555. u = o[q]
  1556. b = u[5]
  1557. p[b] = p[b](w(p, b + 1, u[6]))
  1558. q = q + 1
  1559. u = o[q]
  1560. p[u[5]] = #p[u[6]]
  1561. q = q + 1
  1562. u = o[q]
  1563. b = u[5]
  1564. p[b] = p[b](w(p, b + 1, u[6]))
  1565. q = q + 1
  1566. u = o[q]
  1567. b = u[5]
  1568. a = p[u[6]]
  1569. p[b + 1] = a
  1570. p[b] = a[u[3]]
  1571. q = q + 1
  1572. u = o[q]
  1573. b = u[5]
  1574. p[b] = p[b](p[b + 1])
  1575. q = q + 1
  1576. u = o[q]
  1577. b = u[5]
  1578. a = p[u[6]]
  1579. p[b + 1] = a
  1580. p[b] = a[u[3]]
  1581. q = q + 1
  1582. u = o[q]
  1583. p[u[5]] = u[6]
  1584. q = q + 1
  1585. u = o[q]
  1586. p[u[5]] = u[6]
  1587. q = q + 1
  1588. u = o[q]
  1589. b = u[5]
  1590. p[b] = p[b](w(p, b + 1, u[6]))
  1591. q = q + 1
  1592. u = o[q]
  1593. q = p[u[5]] == p[u[3]] and u[6] or q + 1
  1594. else
  1595. local c, d, e, b
  1596. p[u[5]] = m[u[6]]
  1597. q = q + 1
  1598. u = o[q]
  1599. for a, f in v(k) do
  1600. for a, a in v(f[9]) do
  1601. c, d, e, b = {
  1602. f[a]:byte(1, #f[a])
  1603. }, '', u[5], u[6]
  1604. for a = 1, #c do
  1605. d, e = d..r(t(c[a], e)), (e + b) % s
  1606. end
  1607. f[a], f[9] = d, {}
  1608. end
  1609. end
  1610. q = q + 1
  1611. u = o[q]
  1612. p[u[5]] = p[u[6]][u[3]]
  1613. q = q + 1
  1614. u = o[q]
  1615. p[u[5]] = #p[u[6]]
  1616. q = q + 1
  1617. u = o[q]
  1618. if (u[5] <= p[u[3]]) then
  1619. q = u[6]
  1620. else
  1621. q = q + 1
  1622. end
  1623. end
  1624. elseif a <= 61 then
  1625. q = p[u[5]] and q + 1 or u[6]
  1626. elseif a == 62 then
  1627. p[u[5]] = #p[u[6]]
  1628. else
  1629. local b = u[5]
  1630. local a = p[u[6]]
  1631. p[b + 1] = a
  1632. p[b] = a[u[3]]
  1633. end
  1634. elseif a <= 68 then
  1635. if a <= 65 then
  1636. if a > 64 then
  1637. local a
  1638. p[u[5]][u[6]] = u[3]
  1639. q = q + 1
  1640. u = o[q]
  1641. p[u[5]][u[6]] = u[3]
  1642. q = q + 1
  1643. u = o[q]
  1644. p[u[5]][u[6]] = u[3]
  1645. q = q + 1
  1646. u = o[q]
  1647. p[u[5]] = n[u[6]]
  1648. q = q + 1
  1649. u = o[q]
  1650. p[u[5]] = p[u[6]][u[3]]
  1651. q = q + 1
  1652. u = o[q]
  1653. p[u[5]] = u[6]
  1654. q = q + 1
  1655. u = o[q]
  1656. p[u[5]] = u[6]
  1657. q = q + 1
  1658. u = o[q]
  1659. a = u[5]
  1660. p[a] = p[a](w(p, a + 1, u[6]))
  1661. q = q + 1
  1662. u = o[q]
  1663. p[u[5]][u[6]] = p[u[3]]
  1664. q = q + 1
  1665. u = o[q]
  1666. p[u[5]][u[6]] = u[3]
  1667. q = q + 1
  1668. u = o[q]
  1669. p[u[5]][u[6]] = u[3]
  1670. q = q + 1
  1671. u = o[q]
  1672. p[u[5]] = n[u[6]]
  1673. q = q + 1
  1674. u = o[q]
  1675. p[u[5]] = p[u[6]][u[3]]
  1676. q = q + 1
  1677. u = o[q]
  1678. p[u[5]] = p[u[6]][u[3]]
  1679. q = q + 1
  1680. u = o[q]
  1681. p[u[5]][u[6]] = p[u[3]]
  1682. q = q + 1
  1683. u = o[q]
  1684. p[u[5]] = n[u[6]]
  1685. q = q + 1
  1686. u = o[q]
  1687. p[u[5]] = p[u[6]][u[3]]
  1688. q = q + 1
  1689. u = o[q]
  1690. p[u[5]] = p[u[6]][u[3]]
  1691. q = q + 1
  1692. u = o[q]
  1693. p[u[5]][u[6]] = p[u[3]]
  1694. q = q + 1
  1695. u = o[q]
  1696. p[u[5]][u[6]] = u[3]
  1697. q = q + 1
  1698. u = o[q]
  1699. p[u[5]][u[6]] = u[3]
  1700. q = q + 1
  1701. u = o[q]
  1702. p[u[5]] = n[u[6]]
  1703. q = q + 1
  1704. u = o[q]
  1705. p[u[5]] = p[u[6]][u[3]]
  1706. q = q + 1
  1707. u = o[q]
  1708. p[u[5]] = u[6]
  1709. q = q + 1
  1710. u = o[q]
  1711. p[u[5]] = u[6]
  1712. q = q + 1
  1713. u = o[q]
  1714. p[u[5]] = u[6]
  1715. q = q + 1
  1716. u = o[q]
  1717. p[u[5]] = u[6]
  1718. q = q + 1
  1719. u = o[q]
  1720. a = u[5]
  1721. p[a] = p[a](w(p, a + 1, u[6]))
  1722. q = q + 1
  1723. u = o[q]
  1724. p[u[5]][u[6]] = p[u[3]]
  1725. q = q + 1
  1726. u = o[q]
  1727. p[u[5]] = n[u[6]]
  1728. q = q + 1
  1729. u = o[q]
  1730. p[u[5]] = p[u[6]][u[3]]
  1731. q = q + 1
  1732. u = o[q]
  1733. p[u[5]] = u[6]
  1734. q = q + 1
  1735. u = o[q]
  1736. p[u[5]] = u[6]
  1737. q = q + 1
  1738. u = o[q]
  1739. p[u[5]] = u[6]
  1740. q = q + 1
  1741. u = o[q]
  1742. p[u[5]] = u[6]
  1743. q = q + 1
  1744. u = o[q]
  1745. a = u[5]
  1746. p[a] = p[a](w(p, a + 1, u[6]))
  1747. q = q + 1
  1748. u = o[q]
  1749. p[u[5]][u[6]] = p[u[3]]
  1750. q = q + 1
  1751. u = o[q]
  1752. p[u[5]][u[6]] = u[3]
  1753. q = q + 1
  1754. u = o[q]
  1755. p[u[5]][u[6]] = u[3]
  1756. q = q + 1
  1757. u = o[q]
  1758. p[u[5]] = n[u[6]]
  1759. q = q + 1
  1760. u = o[q]
  1761. p[u[5]] = p[u[6]][u[3]]
  1762. q = q + 1
  1763. u = o[q]
  1764. p[u[5]] = u[6]
  1765. q = q + 1
  1766. u = o[q]
  1767. p[u[5]] = u[6]
  1768. q = q + 1
  1769. u = o[q]
  1770. p[u[5]] = u[6]
  1771. q = q + 1
  1772. u = o[q]
  1773. a = u[5]
  1774. p[a] = p[a](w(p, a + 1, u[6]))
  1775. q = q + 1
  1776. u = o[q]
  1777. p[u[5]][u[6]] = p[u[3]]
  1778. q = q + 1
  1779. u = o[q]
  1780. p[u[5]] = n[u[6]]
  1781. q = q + 1
  1782. u = o[q]
  1783. p[u[5]] = p[u[6]][u[3]]
  1784. q = q + 1
  1785. u = o[q]
  1786. p[u[5]] = u[6]
  1787. q = q + 1
  1788. u = o[q]
  1789. p[u[5]] = u[6]
  1790. q = q + 1
  1791. u = o[q]
  1792. p[u[5]] = u[6]
  1793. q = q + 1
  1794. u = o[q]
  1795. a = u[5]
  1796. p[a] = p[a](w(p, a + 1, u[6]))
  1797. q = q + 1
  1798. u = o[q]
  1799. p[u[5]][u[6]] = p[u[3]]
  1800. q = q + 1
  1801. u = o[q]
  1802. p[u[5]][u[6]] = u[3]
  1803. q = q + 1
  1804. u = o[q]
  1805. p[u[5]] = n[u[6]]
  1806. q = q + 1
  1807. u = o[q]
  1808. p[u[5]] = p[u[6]][u[3]]
  1809. q = q + 1
  1810. u = o[q]
  1811. p[u[5]] = p[u[6]][u[3]]
  1812. q = q + 1
  1813. u = o[q]
  1814. p[u[5]][u[6]] = p[u[3]]
  1815. q = q + 1
  1816. u = o[q]
  1817. p[u[5]][u[6]] = u[3]
  1818. q = q + 1
  1819. u = o[q]
  1820. p[u[5]] = n[u[6]]
  1821. q = q + 1
  1822. u = o[q]
  1823. p[u[5]] = p[u[6]][u[3]]
  1824. q = q + 1
  1825. u = o[q]
  1826. p[u[5]] = p[u[6]][u[3]]
  1827. q = q + 1
  1828. u = o[q]
  1829. p[u[5]][u[6]] = p[u[3]]
  1830. q = q + 1
  1831. u = o[q]
  1832. p[u[5]][u[6]] = u[3]
  1833. q = q + 1
  1834. u = o[q]
  1835. p[u[5]] = n[u[6]]
  1836. q = q + 1
  1837. u = o[q]
  1838. p[u[5]] = p[u[6]][u[3]]
  1839. q = q + 1
  1840. u = o[q]
  1841. p[u[5]] = p[u[6]][u[3]]
  1842. q = q + 1
  1843. u = o[q]
  1844. p[u[5]][u[6]] = p[u[3]]
  1845. q = q + 1
  1846. u = o[q]
  1847. p[u[5]] = n[u[6]]
  1848. q = q + 1
  1849. u = o[q]
  1850. p[u[5]] = p[u[6]][u[3]]
  1851. q = q + 1
  1852. u = o[q]
  1853. p[u[5]] = u[6]
  1854. q = q + 1
  1855. u = o[q]
  1856. p[u[5]] = u[6]
  1857. q = q + 1
  1858. u = o[q]
  1859. p[u[5]] = u[6]
  1860. q = q + 1
  1861. u = o[q]
  1862. a = u[5]
  1863. p[a] = p[a](w(p, a + 1, u[6]))
  1864. q = q + 1
  1865. u = o[q]
  1866. p[u[5]][u[6]] = p[u[3]]
  1867. q = q + 1
  1868. u = o[q]
  1869. p[u[5]] = n[u[6]]
  1870. q = q + 1
  1871. u = o[q]
  1872. p[u[5]] = p[u[6]][u[3]]
  1873. q = q + 1
  1874. u = o[q]
  1875. p[u[5]] = p[u[6]][u[3]]
  1876. q = q + 1
  1877. u = o[q]
  1878. p[u[5]][u[6]] = p[u[3]]
  1879. q = q + 1
  1880. u = o[q]
  1881. p[u[5]][u[6]] = u[3]
  1882. else
  1883. p[u[5]] = (u[6] ~= 0)
  1884. end
  1885. elseif a <= 66 then
  1886. p[u[5]] = p[u[6]][u[3]]
  1887. elseif a > 67 then
  1888. p[u[5]] = p[u[6]][p[u[3]]]
  1889. else
  1890. if (u[5] <= p[u[3]]) then
  1891. q = u[6]
  1892. else
  1893. q = q + 1
  1894. end
  1895. end
  1896. elseif a <= 70 then
  1897. if a == 69 then
  1898. p[u[5]] = m[u[6]]
  1899. q = q + 1
  1900. u = o[q]
  1901. p[u[5]] = p[u[6]][u[3]]
  1902. q = q + 1
  1903. u = o[q]
  1904. p[u[5]][u[6]] = p[u[3]]
  1905. q = q + 1
  1906. u = o[q]
  1907. p[u[5]] = m[u[6]]
  1908. q = q + 1
  1909. u = o[q]
  1910. p[u[5]] = m[u[6]]
  1911. q = q + 1
  1912. u = o[q]
  1913. p[u[5]] = p[u[6]][u[3]]
  1914. q = q + 1
  1915. u = o[q]
  1916. p[u[5]][u[6]] = p[u[3]]
  1917. else
  1918. do
  1919. return p[u[5]]
  1920. end
  1921. end
  1922. elseif a <= 71 then
  1923. local a = u[5]
  1924. p[a] = p[a](w(p, a + 1, u[6]))
  1925. elseif a == 72 then
  1926. p[u[5]][u[6]] = p[u[3]]
  1927. else
  1928. do
  1929. return
  1930. end
  1931. end
  1932. elseif a <= 110 then
  1933. if a <= 91 then
  1934. if a <= 82 then
  1935. if a <= 77 then
  1936. if a <= 75 then
  1937. if a > 74 then
  1938. p[u[5]][p[u[6]]] = p[u[3]]
  1939. else
  1940. p[u[5]] = p[u[6]] - u[3]
  1941. end
  1942. elseif a > 76 then
  1943. q = p[u[5]] == p[u[3]] and q + 1 or u[6]
  1944. else
  1945. p[u[5]] = p[u[6]] + u[3]
  1946. end
  1947. elseif a <= 79 then
  1948. if a > 78 then
  1949. local a
  1950. p[u[5]] = p[u[6]][u[3]]
  1951. q = q + 1
  1952. u = o[q]
  1953. p[u[5]][u[6]] = p[u[3]]
  1954. q = q + 1
  1955. u = o[q]
  1956. p[u[5]][u[6]] = u[3]
  1957. q = q + 1
  1958. u = o[q]
  1959. p[u[5]][u[6]] = u[3]
  1960. q = q + 1
  1961. u = o[q]
  1962. p[u[5]] = n[u[6]]
  1963. q = q + 1
  1964. u = o[q]
  1965. p[u[5]] = p[u[6]][u[3]]
  1966. q = q + 1
  1967. u = o[q]
  1968. p[u[5]] = u[6]
  1969. q = q + 1
  1970. u = o[q]
  1971. p[u[5]] = u[6]
  1972. q = q + 1
  1973. u = o[q]
  1974. p[u[5]] = u[6]
  1975. q = q + 1
  1976. u = o[q]
  1977. a = u[5]
  1978. p[a] = p[a](w(p, a + 1, u[6]))
  1979. else
  1980. local c
  1981. local b
  1982. local a
  1983. p[u[5]] = p[u[6]] + u[3]
  1984. q = q + 1
  1985. u = o[q]
  1986. m[u[6]] = p[u[5]]
  1987. q = q + 1
  1988. u = o[q]
  1989. p[u[5]] = m[u[6]]
  1990. q = q + 1
  1991. u = o[q]
  1992. p[u[5]] = m[u[6]]
  1993. q = q + 1
  1994. u = o[q]
  1995. p[u[5]] = p[u[6]][p[u[3]]]
  1996. q = q + 1
  1997. u = o[q]
  1998. p[u[5]][u[6]] = u[3]
  1999. q = q + 1
  2000. u = o[q]
  2001. p[u[5]] = n[u[6]]
  2002. q = q + 1
  2003. u = o[q]
  2004. p[u[5]] = m[u[6]]
  2005. q = q + 1
  2006. u = o[q]
  2007. a = u[5]
  2008. b = {
  2009. p[a](p[a + 1])
  2010. }
  2011. c = 0
  2012. for a = a, u[3] do
  2013. c = c + 1
  2014. p[a] = b[c]
  2015. end
  2016. q = q + 1
  2017. u = o[q]
  2018. q = u[6]
  2019. end
  2020. elseif a <= 80 then
  2021. local b = u[5]
  2022. local a = {
  2023. p[b](p[b + 1])
  2024. }
  2025. local c = 0
  2026. for b = b, u[3] do
  2027. c = c + 1
  2028. p[b] = a[c]
  2029. end
  2030. elseif a == 81 then
  2031. local a
  2032. p[u[5]] = p[u[6]][u[3]]
  2033. q = q + 1
  2034. u = o[q]
  2035. p[u[5]] = p[u[6]][u[3]]
  2036. q = q + 1
  2037. u = o[q]
  2038. p[u[5]][u[6]] = p[u[3]]
  2039. q = q + 1
  2040. u = o[q]
  2041. p[u[5]][u[6]] = u[3]
  2042. q = q + 1
  2043. u = o[q]
  2044. p[u[5]] = n[u[6]]
  2045. q = q + 1
  2046. u = o[q]
  2047. p[u[5]] = p[u[6]][u[3]]
  2048. q = q + 1
  2049. u = o[q]
  2050. p[u[5]] = p[u[6]][u[3]]
  2051. q = q + 1
  2052. u = o[q]
  2053. p[u[5]][u[6]] = p[u[3]]
  2054. q = q + 1
  2055. u = o[q]
  2056. p[u[5]] = n[u[6]]
  2057. q = q + 1
  2058. u = o[q]
  2059. p[u[5]] = p[u[6]][u[3]]
  2060. q = q + 1
  2061. u = o[q]
  2062. p[u[5]] = p[u[6]][u[3]]
  2063. q = q + 1
  2064. u = o[q]
  2065. p[u[5]][u[6]] = p[u[3]]
  2066. q = q + 1
  2067. u = o[q]
  2068. p[u[5]][u[6]] = u[3]
  2069. q = q + 1
  2070. u = o[q]
  2071. p[u[5]][u[6]] = u[3]
  2072. q = q + 1
  2073. u = o[q]
  2074. p[u[5]] = n[u[6]]
  2075. q = q + 1
  2076. u = o[q]
  2077. p[u[5]] = p[u[6]][u[3]]
  2078. q = q + 1
  2079. u = o[q]
  2080. p[u[5]] = u[6]
  2081. q = q + 1
  2082. u = o[q]
  2083. p[u[5]] = u[6]
  2084. q = q + 1
  2085. u = o[q]
  2086. p[u[5]] = u[6]
  2087. q = q + 1
  2088. u = o[q]
  2089. p[u[5]] = u[6]
  2090. q = q + 1
  2091. u = o[q]
  2092. a = u[5]
  2093. p[a] = p[a](w(p, a + 1, u[6]))
  2094. q = q + 1
  2095. u = o[q]
  2096. p[u[5]][u[6]] = p[u[3]]
  2097. q = q + 1
  2098. u = o[q]
  2099. p[u[5]][u[6]] = u[3]
  2100. q = q + 1
  2101. u = o[q]
  2102. p[u[5]][u[6]] = u[3]
  2103. q = q + 1
  2104. u = o[q]
  2105. p[u[5]][u[6]] = u[3]
  2106. q = q + 1
  2107. u = o[q]
  2108. p[u[5]] = n[u[6]]
  2109. q = q + 1
  2110. u = o[q]
  2111. p[u[5]] = p[u[6]][u[3]]
  2112. q = q + 1
  2113. u = o[q]
  2114. p[u[5]] = u[6]
  2115. q = q + 1
  2116. u = o[q]
  2117. p[u[5]] = u[6]
  2118. q = q + 1
  2119. u = o[q]
  2120. p[u[5]] = u[6]
  2121. q = q + 1
  2122. u = o[q]
  2123. a = u[5]
  2124. p[a] = p[a](w(p, a + 1, u[6]))
  2125. q = q + 1
  2126. u = o[q]
  2127. p[u[5]][u[6]] = p[u[3]]
  2128. q = q + 1
  2129. u = o[q]
  2130. p[u[5]] = n[u[6]]
  2131. q = q + 1
  2132. u = o[q]
  2133. p[u[5]] = p[u[6]][u[3]]
  2134. q = q + 1
  2135. u = o[q]
  2136. p[u[5]] = u[6]
  2137. q = q + 1
  2138. u = o[q]
  2139. p[u[5]] = u[6]
  2140. q = q + 1
  2141. u = o[q]
  2142. p[u[5]] = u[6]
  2143. q = q + 1
  2144. u = o[q]
  2145. a = u[5]
  2146. p[a] = p[a](w(p, a + 1, u[6]))
  2147. q = q + 1
  2148. u = o[q]
  2149. p[u[5]][u[6]] = p[u[3]]
  2150. q = q + 1
  2151. u = o[q]
  2152. p[u[5]][u[6]] = u[3]
  2153. q = q + 1
  2154. u = o[q]
  2155. p[u[5]] = n[u[6]]
  2156. q = q + 1
  2157. u = o[q]
  2158. p[u[5]] = p[u[6]][u[3]]
  2159. q = q + 1
  2160. u = o[q]
  2161. p[u[5]] = u[6]
  2162. q = q + 1
  2163. u = o[q]
  2164. p[u[5]] = u[6]
  2165. q = q + 1
  2166. u = o[q]
  2167. p[u[5]] = u[6]
  2168. q = q + 1
  2169. u = o[q]
  2170. p[u[5]] = u[6]
  2171. q = q + 1
  2172. u = o[q]
  2173. a = u[5]
  2174. p[a] = p[a](w(p, a + 1, u[6]))
  2175. q = q + 1
  2176. u = o[q]
  2177. p[u[5]][u[6]] = p[u[3]]
  2178. q = q + 1
  2179. u = o[q]
  2180. p[u[5]][u[6]] = u[3]
  2181. q = q + 1
  2182. u = o[q]
  2183. p[u[5]][u[6]] = u[3]
  2184. q = q + 1
  2185. u = o[q]
  2186. p[u[5]] = n[u[6]]
  2187. q = q + 1
  2188. u = o[q]
  2189. p[u[5]] = p[u[6]][u[3]]
  2190. q = q + 1
  2191. u = o[q]
  2192. p[u[5]] = p[u[6]][u[3]]
  2193. q = q + 1
  2194. u = o[q]
  2195. p[u[5]][u[6]] = p[u[3]]
  2196. q = q + 1
  2197. u = o[q]
  2198. p[u[5]][u[6]] = u[3]
  2199. q = q + 1
  2200. u = o[q]
  2201. p[u[5]][u[6]] = u[3]
  2202. q = q + 1
  2203. u = o[q]
  2204. p[u[5]] = n[u[6]]
  2205. q = q + 1
  2206. u = o[q]
  2207. p[u[5]] = p[u[6]][u[3]]
  2208. q = q + 1
  2209. u = o[q]
  2210. p[u[5]] = u[6]
  2211. q = q + 1
  2212. u = o[q]
  2213. p[u[5]] = u[6]
  2214. q = q + 1
  2215. u = o[q]
  2216. p[u[5]] = u[6]
  2217. q = q + 1
  2218. u = o[q]
  2219. a = u[5]
  2220. p[a] = p[a](w(p, a + 1, u[6]))
  2221. q = q + 1
  2222. u = o[q]
  2223. p[u[5]][u[6]] = p[u[3]]
  2224. q = q + 1
  2225. u = o[q]
  2226. p[u[5]] = n[u[6]]
  2227. q = q + 1
  2228. u = o[q]
  2229. p[u[5]] = p[u[6]][u[3]]
  2230. q = q + 1
  2231. u = o[q]
  2232. p[u[5]] = p[u[6]][u[3]]
  2233. q = q + 1
  2234. u = o[q]
  2235. p[u[5]][u[6]] = p[u[3]]
  2236. q = q + 1
  2237. u = o[q]
  2238. p[u[5]][u[6]] = u[3]
  2239. q = q + 1
  2240. u = o[q]
  2241. p[u[5]] = n[u[6]]
  2242. q = q + 1
  2243. u = o[q]
  2244. p[u[5]] = p[u[6]][u[3]]
  2245. q = q + 1
  2246. u = o[q]
  2247. p[u[5]] = u[6]
  2248. q = q + 1
  2249. u = o[q]
  2250. p[u[5]] = u[6]
  2251. q = q + 1
  2252. u = o[q]
  2253. p[u[5]] = u[6]
  2254. q = q + 1
  2255. u = o[q]
  2256. a = u[5]
  2257. p[a] = p[a](w(p, a + 1, u[6]))
  2258. q = q + 1
  2259. u = o[q]
  2260. p[u[5]][u[6]] = p[u[3]]
  2261. q = q + 1
  2262. u = o[q]
  2263. p[u[5]][u[6]] = p[u[3]]
  2264. q = q + 1
  2265. u = o[q]
  2266. p[u[5]] = {}
  2267. q = q + 1
  2268. u = o[q]
  2269. p[u[5]][u[6]] = u[3]
  2270. q = q + 1
  2271. u = o[q]
  2272. p[u[5]][u[6]] = u[3]
  2273. q = q + 1
  2274. u = o[q]
  2275. p[u[5]][u[6]] = u[3]
  2276. else
  2277. local a
  2278. local g
  2279. local d, a
  2280. local h
  2281. local c, e, f, b
  2282. p[u[5]] = m[u[6]]
  2283. q = q + 1
  2284. u = o[q]
  2285. for a, d in v(k) do
  2286. for a, a in v(d[9]) do
  2287. c, e, f, b = {
  2288. d[a]:byte(1, #d[a])
  2289. }, '', u[5], u[6]
  2290. for a = 1, #c do
  2291. e, f = e..r(t(c[a], f)), (f + b) % s
  2292. end
  2293. d[a], d[9] = e, {}
  2294. end
  2295. end
  2296. q = q + 1
  2297. u = o[q]
  2298. p[u[5]][u[6]] = u[3]
  2299. q = q + 1
  2300. u = o[q]
  2301. p[u[5]] = m[u[6]]
  2302. q = q + 1
  2303. u = o[q]
  2304. p[u[5]]()
  2305. q = q + 1
  2306. u = o[q]
  2307. p[u[5]] = {}
  2308. q = q + 1
  2309. u = o[q]
  2310. p[u[5]] = n[u[6]]
  2311. q = q + 1
  2312. u = o[q]
  2313. p[u[5]] = m[u[6]]
  2314. q = q + 1
  2315. u = o[q]
  2316. p[u[5]] = m[u[6]]
  2317. q = q + 1
  2318. u = o[q]
  2319. p[u[5]] = p[u[6]][u[3]]
  2320. q = q + 1
  2321. u = o[q]
  2322. h = u[5]
  2323. d, a = j(p[h](p[h + 1]))
  2324. l = a + h - 1
  2325. g = 0
  2326. for a = h, l do
  2327. g = g + 1
  2328. p[a] = d[g]
  2329. end
  2330. q = q + 1
  2331. u = o[q]
  2332. h = u[5]
  2333. d = {
  2334. p[h](w(p, h + 1, l))
  2335. }
  2336. g = 0
  2337. for a = h, u[3] do
  2338. g = g + 1
  2339. p[a] = d[g]
  2340. end
  2341. q = q + 1
  2342. u = o[q]
  2343. q = u[6]
  2344. end
  2345. elseif a <= 86 then
  2346. if a <= 84 then
  2347. if a > 83 then
  2348. local a = u[5]
  2349. p[a](w(p, a + 1, u[6]))
  2350. else
  2351. do
  2352. return
  2353. end
  2354. end
  2355. elseif a > 85 then
  2356. q = p[u[5]] == u[3] and u[6] or q + 1
  2357. else
  2358. p[u[5]] = p[u[6]][p[u[3]]]
  2359. end
  2360. elseif a <= 88 then
  2361. if a > 87 then
  2362. local a = u[5]
  2363. p[a] = p[a]()
  2364. else
  2365. local c, e, d, b
  2366. p[u[5]] = m[u[6]]
  2367. q = q + 1
  2368. u = o[q]
  2369. for a, f in v(k) do
  2370. for a, a in v(f[9]) do
  2371. c, e, d, b = {
  2372. f[a]:byte(1, #f[a])
  2373. }, '', u[5], u[6]
  2374. for a = 1, #c do
  2375. e, d = e..r(t(c[a], d)), (d + b) % s
  2376. end
  2377. f[a], f[9] = e, {}
  2378. end
  2379. end
  2380. q = q + 1
  2381. u = o[q]
  2382. p[u[5]][u[6]] = u[3]
  2383. q = q + 1
  2384. u = o[q]
  2385. p[u[5]] = m[u[6]]
  2386. q = q + 1
  2387. u = o[q]
  2388. p[u[5]]()
  2389. q = q + 1
  2390. u = o[q]
  2391. do
  2392. return
  2393. end
  2394. end
  2395. elseif a <= 89 then
  2396. local a
  2397. p[u[5]] = n[u[6]]
  2398. q = q + 1
  2399. u = o[q]
  2400. p[u[5]] = p[u[6]][u[3]]
  2401. q = q + 1
  2402. u = o[q]
  2403. p[u[5]] = u[6]
  2404. q = q + 1
  2405. u = o[q]
  2406. p[u[5]] = u[6]
  2407. q = q + 1
  2408. u = o[q]
  2409. p[u[5]] = u[6]
  2410. q = q + 1
  2411. u = o[q]
  2412. p[u[5]] = u[6]
  2413. q = q + 1
  2414. u = o[q]
  2415. a = u[5]
  2416. p[a] = p[a](w(p, a + 1, u[6]))
  2417. q = q + 1
  2418. u = o[q]
  2419. p[u[5]][u[6]] = p[u[3]]
  2420. elseif a == 90 then
  2421. local a = u[5]
  2422. p[a] = p[a](w(p, a + 1, u[6]))
  2423. else
  2424. local a
  2425. local b
  2426. p[u[5]] = m[u[6]]
  2427. q = q + 1
  2428. u = o[q]
  2429. p[u[5]] = p[u[6]][u[3]]
  2430. q = q + 1
  2431. u = o[q]
  2432. b = u[5]
  2433. a = p[u[6]]
  2434. p[b + 1] = a
  2435. p[b] = a[u[3]]
  2436. q = q + 1
  2437. u = o[q]
  2438. p[u[5]] = p[u[6]]
  2439. q = q + 1
  2440. u = o[q]
  2441. p[u[5]] = p[u[6]]
  2442. q = q + 1
  2443. u = o[q]
  2444. b = u[5]
  2445. p[b] = p[b](w(p, b + 1, u[6]))
  2446. q = q + 1
  2447. u = o[q]
  2448. p[u[5]][u[6]] = p[u[3]]
  2449. q = q + 1
  2450. u = o[q]
  2451. p[u[5]] = m[u[6]]
  2452. q = q + 1
  2453. u = o[q]
  2454. p[u[5]] = p[u[6]]
  2455. q = q + 1
  2456. u = o[q]
  2457. b = u[5]
  2458. p[b](p[b + 1])
  2459. end
  2460. elseif a <= 100 then
  2461. if a <= 95 then
  2462. if a <= 93 then
  2463. if a == 92 then
  2464. local b = u[5]
  2465. local a = u[3]
  2466. local c = b + 2
  2467. local b = {
  2468. p[b](p[b + 1], p[c])
  2469. }
  2470. for a = 1, a do
  2471. p[c + a] = b[a]
  2472. end
  2473. local a = b[1]
  2474. if a then
  2475. p[c] = a
  2476. q = u[6]
  2477. else
  2478. q = q + 1
  2479. end
  2480. else
  2481. p[u[5]] = #p[u[6]]
  2482. end
  2483. elseif a > 94 then
  2484. if (u[5] <= p[u[3]]) then
  2485. q = q + 1
  2486. else
  2487. q = u[6]
  2488. end
  2489. else
  2490. local c
  2491. local b
  2492. local a
  2493. p[u[5]] = p[u[6]] - u[3]
  2494. q = q + 1
  2495. u = o[q]
  2496. m[u[6]] = p[u[5]]
  2497. q = q + 1
  2498. u = o[q]
  2499. p[u[5]] = m[u[6]]
  2500. q = q + 1
  2501. u = o[q]
  2502. p[u[5]] = m[u[6]]
  2503. q = q + 1
  2504. u = o[q]
  2505. p[u[5]] = p[u[6]][p[u[3]]]
  2506. q = q + 1
  2507. u = o[q]
  2508. p[u[5]][u[6]] = u[3]
  2509. q = q + 1
  2510. u = o[q]
  2511. p[u[5]] = n[u[6]]
  2512. q = q + 1
  2513. u = o[q]
  2514. p[u[5]] = m[u[6]]
  2515. q = q + 1
  2516. u = o[q]
  2517. a = u[5]
  2518. b = {
  2519. p[a](p[a + 1])
  2520. }
  2521. c = 0
  2522. for a = a, u[3] do
  2523. c = c + 1
  2524. p[a] = b[c]
  2525. end
  2526. q = q + 1
  2527. u = o[q]
  2528. q = u[6]
  2529. end
  2530. elseif a <= 97 then
  2531. if a == 96 then
  2532. local a
  2533. p[u[5]] = p[u[6]][u[3]]
  2534. q = q + 1
  2535. u = o[q]
  2536. p[u[5]] = p[u[6]]
  2537. q = q + 1
  2538. u = o[q]
  2539. p[u[5]] = {}
  2540. q = q + 1
  2541. u = o[q]
  2542. p[u[5]][u[6]] = p[u[3]]
  2543. q = q + 1
  2544. u = o[q]
  2545. p[u[5]][u[6]] = p[u[3]]
  2546. q = q + 1
  2547. u = o[q]
  2548. a = u[5]
  2549. p[a](w(p, a + 1, u[6]))
  2550. else
  2551. local a
  2552. p[u[5]] = n[u[6]]
  2553. q = q + 1
  2554. u = o[q]
  2555. p[u[5]] = p[u[6]][u[3]]
  2556. q = q + 1
  2557. u = o[q]
  2558. p[u[5]] = u[6]
  2559. q = q + 1
  2560. u = o[q]
  2561. p[u[5]] = u[6]
  2562. q = q + 1
  2563. u = o[q]
  2564. p[u[5]] = u[6]
  2565. q = q + 1
  2566. u = o[q]
  2567. p[u[5]] = m[u[6]]
  2568. q = q + 1
  2569. u = o[q]
  2570. p[u[5]] = p[u[6]][u[3]]
  2571. q = q + 1
  2572. u = o[q]
  2573. p[u[5]] = p[u[6]][u[3]]
  2574. q = q + 1
  2575. u = o[q]
  2576. p[u[5]] = p[u[6]][u[3]]
  2577. q = q + 1
  2578. u = o[q]
  2579. a = u[5]
  2580. p[a] = p[a](w(p, a + 1, u[6]))
  2581. q = q + 1
  2582. u = o[q]
  2583. p[u[5]][u[6]] = p[u[3]]
  2584. q = q + 1
  2585. u = o[q]
  2586. p[u[5]] = m[u[6]]
  2587. q = q + 1
  2588. u = o[q]
  2589. p[u[5]][u[6]] = u[3]
  2590. q = q + 1
  2591. u = o[q]
  2592. do
  2593. return
  2594. end
  2595. end
  2596. elseif a <= 98 then
  2597. n[u[6]] = p[u[5]]
  2598. elseif a == 99 then
  2599. local a
  2600. local b
  2601. p[u[5]] = m[u[6]]
  2602. q = q + 1
  2603. u = o[q]
  2604. p[u[5]] = p[u[6]][u[3]]
  2605. q = q + 1
  2606. u = o[q]
  2607. b = u[5]
  2608. a = p[u[6]]
  2609. p[b + 1] = a
  2610. p[b] = a[u[3]]
  2611. q = q + 1
  2612. u = o[q]
  2613. p[u[5]] = p[u[6]]
  2614. q = q + 1
  2615. u = o[q]
  2616. p[u[5]] = p[u[6]]
  2617. q = q + 1
  2618. u = o[q]
  2619. b = u[5]
  2620. p[b] = p[b](w(p, b + 1, u[6]))
  2621. q = q + 1
  2622. u = o[q]
  2623. p[u[5]][u[6]] = p[u[3]]
  2624. q = q + 1
  2625. u = o[q]
  2626. p[u[5]] = m[u[6]]
  2627. q = q + 1
  2628. u = o[q]
  2629. p[u[5]] = m[u[6]]
  2630. q = q + 1
  2631. u = o[q]
  2632. p[u[5]] = p[u[6]][u[3]]
  2633. q = q + 1
  2634. u = o[q]
  2635. p[u[5]] = #p[u[6]]
  2636. q = q + 1
  2637. u = o[q]
  2638. p[u[5]] = p[u[6]] + u[3]
  2639. q = q + 1
  2640. u = o[q]
  2641. p[u[5]][u[6]] = p[u[3]]
  2642. else
  2643. local a
  2644. p[u[5]] = n[u[6]]
  2645. q = q + 1
  2646. u = o[q]
  2647. p[u[5]] = p[u[6]][u[3]]
  2648. q = q + 1
  2649. u = o[q]
  2650. p[u[5]] = u[6]
  2651. q = q + 1
  2652. u = o[q]
  2653. p[u[5]] = u[6]
  2654. q = q + 1
  2655. u = o[q]
  2656. p[u[5]] = u[6]
  2657. q = q + 1
  2658. u = o[q]
  2659. p[u[5]] = m[u[6]]
  2660. q = q + 1
  2661. u = o[q]
  2662. p[u[5]] = p[u[6]][u[3]]
  2663. q = q + 1
  2664. u = o[q]
  2665. p[u[5]] = p[u[6]][u[3]]
  2666. q = q + 1
  2667. u = o[q]
  2668. p[u[5]] = p[u[6]][u[3]]
  2669. q = q + 1
  2670. u = o[q]
  2671. a = u[5]
  2672. p[a] = p[a](w(p, a + 1, u[6]))
  2673. q = q + 1
  2674. u = o[q]
  2675. p[u[5]][u[6]] = p[u[3]]
  2676. q = q + 1
  2677. u = o[q]
  2678. p[u[5]] = n[u[6]]
  2679. q = q + 1
  2680. u = o[q]
  2681. p[u[5]] = p[u[6]][u[3]]
  2682. q = q + 1
  2683. u = o[q]
  2684. p[u[5]] = u[6]
  2685. q = q + 1
  2686. u = o[q]
  2687. p[u[5]] = u[6]
  2688. q = q + 1
  2689. u = o[q]
  2690. p[u[5]] = u[6]
  2691. q = q + 1
  2692. u = o[q]
  2693. p[u[5]] = m[u[6]]
  2694. q = q + 1
  2695. u = o[q]
  2696. p[u[5]] = p[u[6]][u[3]]
  2697. q = q + 1
  2698. u = o[q]
  2699. p[u[5]] = p[u[6]][u[3]]
  2700. q = q + 1
  2701. u = o[q]
  2702. p[u[5]] = p[u[6]][u[3]]
  2703. q = q + 1
  2704. u = o[q]
  2705. a = u[5]
  2706. p[a] = p[a](w(p, a + 1, u[6]))
  2707. q = q + 1
  2708. u = o[q]
  2709. p[u[5]] = p[u[6]][u[3]]
  2710. q = q + 1
  2711. u = o[q]
  2712. p[u[5]] = p[u[6]][u[3]]
  2713. q = q + 1
  2714. u = o[q]
  2715. if (u[5] < p[u[3]]) then
  2716. q = u[6]
  2717. else
  2718. q = q + 1
  2719. end
  2720. end
  2721. elseif a <= 105 then
  2722. if a <= 102 then
  2723. if a > 101 then
  2724. local a = e[u[6]]
  2725. local b
  2726. local c = {}
  2727. b = f({}, {
  2728. __index = function(a, a)
  2729. local a = c[a]
  2730. return a[1][a[2]]
  2731. end,
  2732. __newindex = function(a, a, b)
  2733. local a = c[a]
  2734. a[1][a[2]] = b
  2735. end
  2736. })
  2737. for a = 1, u[3] do
  2738. q = q + 1
  2739. local b = o[q]
  2740. if b[2] == 57 then
  2741. c[a - 1] = {
  2742. p,
  2743. b[6]
  2744. }
  2745. else
  2746. c[a - 1] = {
  2747. m,
  2748. b[6]
  2749. }
  2750. end
  2751. h[#h + 1] = c
  2752. end
  2753. p[u[5]] = i(a, b, n)
  2754. else
  2755. local a
  2756. a = u[5]
  2757. p[a](w(p, a + 1, u[6]))
  2758. q = q + 1
  2759. u = o[q]
  2760. p[u[5]] = n[u[6]]
  2761. q = q + 1
  2762. u = o[q]
  2763. p[u[5]] = p[u[6]][u[3]]
  2764. q = q + 1
  2765. u = o[q]
  2766. p[u[5]] = m[u[6]]
  2767. q = q + 1
  2768. u = o[q]
  2769. p[u[5]] = p[u[6]]
  2770. q = q + 1
  2771. u = o[q]
  2772. a = u[5]
  2773. p[a](w(p, a + 1, u[6]))
  2774. end
  2775. elseif a <= 103 then
  2776. local a
  2777. local b
  2778. p[u[5]] = u[6]
  2779. q = q + 1
  2780. u = o[q]
  2781. p[u[5]] = u[6]
  2782. q = q + 1
  2783. u = o[q]
  2784. b = u[5]
  2785. p[b] = p[b](w(p, b + 1, u[6]))
  2786. q = q + 1
  2787. u = o[q]
  2788. p[u[5]][p[u[6]]] = p[u[3]]
  2789. q = q + 1
  2790. u = o[q]
  2791. b = u[5]
  2792. a = p[u[6]]
  2793. p[b + 1] = a
  2794. p[b] = a[u[3]]
  2795. q = q + 1
  2796. u = o[q]
  2797. p[u[5]] = u[6]
  2798. q = q + 1
  2799. u = o[q]
  2800. p[u[5]] = u[6]
  2801. q = q + 1
  2802. u = o[q]
  2803. b = u[5]
  2804. p[b] = p[b](w(p, b + 1, u[6]))
  2805. q = q + 1
  2806. u = o[q]
  2807. p[u[5]] = p[u[6]][p[u[3]]]
  2808. q = q + 1
  2809. u = o[q]
  2810. p[u[5]][u[6]] = p[u[3]]
  2811. elseif a > 104 then
  2812. local c
  2813. local b, a
  2814. local d
  2815. local e
  2816. p[u[5]] = u[6]
  2817. q = q + 1
  2818. u = o[q]
  2819. e = u[5]
  2820. p[e] = p[e](w(p, e + 1, u[6]))
  2821. q = q + 1
  2822. u = o[q]
  2823. e = u[5]
  2824. d = p[u[6]]
  2825. p[e + 1] = d
  2826. p[e] = d[u[3]]
  2827. q = q + 1
  2828. u = o[q]
  2829. p[u[5]] = u[6]
  2830. q = q + 1
  2831. u = o[q]
  2832. e = u[5]
  2833. p[e] = p[e](w(p, e + 1, u[6]))
  2834. q = q + 1
  2835. u = o[q]
  2836. p[u[5]] = n[u[6]]
  2837. q = q + 1
  2838. u = o[q]
  2839. p[u[5]] = n[u[6]]
  2840. q = q + 1
  2841. u = o[q]
  2842. e = u[5]
  2843. d = p[u[6]]
  2844. p[e + 1] = d
  2845. p[e] = d[u[3]]
  2846. q = q + 1
  2847. u = o[q]
  2848. p[u[5]] = u[6]
  2849. q = q + 1
  2850. u = o[q]
  2851. e = u[5]
  2852. b, a = j(p[e](w(p, e + 1, u[6])))
  2853. l = a + e - 1
  2854. c = 0
  2855. for a = e, l do
  2856. c = c + 1
  2857. p[a] = b[c]
  2858. end
  2859. else
  2860. local a
  2861. p[u[5]] = n[u[6]]
  2862. q = q + 1
  2863. u = o[q]
  2864. p[u[5]] = p[u[6]][u[3]]
  2865. q = q + 1
  2866. u = o[q]
  2867. p[u[5]] = p[u[6]][u[3]]
  2868. q = q + 1
  2869. u = o[q]
  2870. p[u[5]][u[6]] = p[u[3]]
  2871. q = q + 1
  2872. u = o[q]
  2873. p[u[5]] = n[u[6]]
  2874. q = q + 1
  2875. u = o[q]
  2876. p[u[5]] = p[u[6]][u[3]]
  2877. q = q + 1
  2878. u = o[q]
  2879. p[u[5]] = u[6]
  2880. q = q + 1
  2881. u = o[q]
  2882. p[u[5]] = u[6]
  2883. q = q + 1
  2884. u = o[q]
  2885. a = u[5]
  2886. p[a] = p[a](w(p, a + 1, u[6]))
  2887. q = q + 1
  2888. u = o[q]
  2889. p[u[5]][u[6]] = p[u[3]]
  2890. end
  2891. elseif a <= 107 then
  2892. if a > 106 then
  2893. q = p[u[5]] == u[3] and q + 1 or u[6]
  2894. else
  2895. local a = u[5]
  2896. p[a](w(p, a + 1, u[6]))
  2897. end
  2898. elseif a <= 108 then
  2899. p[u[5]] = p[u[6]][u[3]]
  2900. q = q + 1
  2901. u = o[q]
  2902. p[u[5]] = (u[6] ~= 0)
  2903. q = q + 1
  2904. u = o[q]
  2905. p[u[5]] = m[u[6]]
  2906. q = q + 1
  2907. u = o[q]
  2908. p[u[5]] = #p[u[6]]
  2909. q = q + 1
  2910. u = o[q]
  2911. if (p[u[5]] < p[u[3]]) then
  2912. q = u[6]
  2913. else
  2914. q = q + 1
  2915. end
  2916. elseif a == 109 then
  2917. for a, f in v(k) do
  2918. for a, a in v(f[9]) do
  2919. local c, d, e, b = {
  2920. f[a]:byte(1, #f[a])
  2921. }, '', u[5], u[6]
  2922. for a = 1, #c do
  2923. d, e = d..r(t(c[a], e)), (e + b) % s
  2924. end
  2925. f[a], f[9] = d, {}
  2926. end
  2927. end
  2928. else
  2929. local a
  2930. local b
  2931. b = u[5]
  2932. a = p[u[6]]
  2933. p[b + 1] = a
  2934. p[b] = a[u[3]]
  2935. q = q + 1
  2936. u = o[q]
  2937. b = u[5]
  2938. p[b](p[b + 1])
  2939. q = q + 1
  2940. u = o[q]
  2941. p[u[5]] = n[u[6]]
  2942. q = q + 1
  2943. u = o[q]
  2944. p[u[5]]()
  2945. q = q + 1
  2946. u = o[q]
  2947. q = u[6]
  2948. end
  2949. elseif a <= 129 then
  2950. if a <= 119 then
  2951. if a <= 114 then
  2952. if a <= 112 then
  2953. if a == 111 then
  2954. q = p[u[5]] and u[6] or q + 1
  2955. else
  2956. local d = u[5]
  2957. local b, a = j(p[d](w(p, d + 1, u[6])))
  2958. l = a + d - 1
  2959. local c = 0
  2960. for a = d, l do
  2961. c = c + 1
  2962. p[a] = b[c]
  2963. end
  2964. end
  2965. elseif a > 113 then
  2966. p[u[5]] = p[u[6]] - u[3]
  2967. else
  2968. local f
  2969. local b, a
  2970. local h
  2971. local i
  2972. local d, e, g, c
  2973. for a, b in v(k) do
  2974. for a, a in v(b[9]) do
  2975. d, e, g, c = {
  2976. b[a]:byte(1, #b[a])
  2977. }, '', u[5], u[6]
  2978. for a = 1, #d do
  2979. e, g = e..r(t(d[a], g)), (g + c) % s
  2980. end
  2981. b[a], b[9] = e, {}
  2982. end
  2983. end
  2984. q = q + 1
  2985. u = o[q]
  2986. p[u[5]] = n[u[6]]
  2987. q = q + 1
  2988. u = o[q]
  2989. i = u[5]
  2990. h = p[u[6]]
  2991. p[i + 1] = h
  2992. p[i] = h[u[3]]
  2993. q = q + 1
  2994. u = o[q]
  2995. p[u[5]] = u[6]
  2996. q = q + 1
  2997. u = o[q]
  2998. i = u[5]
  2999. p[i] = p[i](w(p, i + 1, u[6]))
  3000. q = q + 1
  3001. u = o[q]
  3002. p[u[5]] = p[u[6]][u[3]]
  3003. q = q + 1
  3004. u = o[q]
  3005. i = u[5]
  3006. h = p[u[6]]
  3007. p[i + 1] = h
  3008. p[i] = h[u[3]]
  3009. q = q + 1
  3010. u = o[q]
  3011. p[u[5]] = u[6]
  3012. q = q + 1
  3013. u = o[q]
  3014. i = u[5]
  3015. p[i] = p[i](w(p, i + 1, u[6]))
  3016. q = q + 1
  3017. u = o[q]
  3018. i = u[5]
  3019. h = p[u[6]]
  3020. p[i + 1] = h
  3021. p[i] = h[u[3]]
  3022. q = q + 1
  3023. u = o[q]
  3024. p[u[5]] = u[6]
  3025. q = q + 1
  3026. u = o[q]
  3027. i = u[5]
  3028. p[i] = p[i](w(p, i + 1, u[6]))
  3029. q = q + 1
  3030. u = o[q]
  3031. p[u[5]] = n[u[6]]
  3032. q = q + 1
  3033. u = o[q]
  3034. p[u[5]] = n[u[6]]
  3035. q = q + 1
  3036. u = o[q]
  3037. i = u[5]
  3038. h = p[u[6]]
  3039. p[i + 1] = h
  3040. p[i] = h[u[3]]
  3041. q = q + 1
  3042. u = o[q]
  3043. p[u[5]] = u[6]
  3044. q = q + 1
  3045. u = o[q]
  3046. i = u[5]
  3047. b, a = j(p[i](w(p, i + 1, u[6])))
  3048. l = a + i - 1
  3049. f = 0
  3050. for a = i, l do
  3051. f = f + 1
  3052. p[a] = b[f]
  3053. end
  3054. q = q + 1
  3055. u = o[q]
  3056. i = u[5]
  3057. p[i] = p[i](w(p, i + 1, l))
  3058. q = q + 1
  3059. u = o[q]
  3060. i = u[5]
  3061. p[i] = p[i]()
  3062. q = q + 1
  3063. u = o[q]
  3064. p[u[5]] = {}
  3065. q = q + 1
  3066. u = o[q]
  3067. p[u[5]] = {}
  3068. q = q + 1
  3069. u = o[q]
  3070. p[u[5]][u[6]] = u[3]
  3071. q = q + 1
  3072. u = o[q]
  3073. p[u[5]][u[6]] = u[3]
  3074. q = q + 1
  3075. u = o[q]
  3076. p[u[5]] = n[u[6]]
  3077. q = q + 1
  3078. u = o[q]
  3079. p[u[5]] = p[u[6]][u[3]]
  3080. q = q + 1
  3081. u = o[q]
  3082. p[u[5]] = p[u[6]][u[3]]
  3083. q = q + 1
  3084. u = o[q]
  3085. p[u[5]][u[6]] = p[u[3]]
  3086. q = q + 1
  3087. u = o[q]
  3088. p[u[5]] = n[u[6]]
  3089. q = q + 1
  3090. u = o[q]
  3091. p[u[5]] = p[u[6]][u[3]]
  3092. q = q + 1
  3093. u = o[q]
  3094. p[u[5]] = p[u[6]][u[3]]
  3095. q = q + 1
  3096. u = o[q]
  3097. p[u[5]][u[6]] = p[u[3]]
  3098. q = q + 1
  3099. u = o[q]
  3100. p[u[5]][u[6]] = u[3]
  3101. q = q + 1
  3102. u = o[q]
  3103. p[u[5]][u[6]] = u[3]
  3104. q = q + 1
  3105. u = o[q]
  3106. p[u[5]] = n[u[6]]
  3107. q = q + 1
  3108. u = o[q]
  3109. p[u[5]] = p[u[6]][u[3]]
  3110. q = q + 1
  3111. u = o[q]
  3112. p[u[5]] = u[6]
  3113. q = q + 1
  3114. u = o[q]
  3115. p[u[5]] = u[6]
  3116. q = q + 1
  3117. u = o[q]
  3118. p[u[5]] = u[6]
  3119. q = q + 1
  3120. u = o[q]
  3121. p[u[5]] = u[6]
  3122. q = q + 1
  3123. u = o[q]
  3124. i = u[5]
  3125. p[i] = p[i](w(p, i + 1, u[6]))
  3126. q = q + 1
  3127. u = o[q]
  3128. p[u[5]][u[6]] = p[u[3]]
  3129. q = q + 1
  3130. u = o[q]
  3131. p[u[5]][u[6]] = u[3]
  3132. q = q + 1
  3133. u = o[q]
  3134. p[u[5]][u[6]] = u[3]
  3135. q = q + 1
  3136. u = o[q]
  3137. p[u[5]] = n[u[6]]
  3138. q = q + 1
  3139. u = o[q]
  3140. p[u[5]] = p[u[6]][u[3]]
  3141. q = q + 1
  3142. u = o[q]
  3143. p[u[5]] = u[6]
  3144. q = q + 1
  3145. u = o[q]
  3146. p[u[5]] = u[6]
  3147. q = q + 1
  3148. u = o[q]
  3149. i = u[5]
  3150. p[i] = p[i](w(p, i + 1, u[6]))
  3151. q = q + 1
  3152. u = o[q]
  3153. p[u[5]][u[6]] = p[u[3]]
  3154. q = q + 1
  3155. u = o[q]
  3156. p[u[5]] = n[u[6]]
  3157. q = q + 1
  3158. u = o[q]
  3159. p[u[5]] = p[u[6]][u[3]]
  3160. q = q + 1
  3161. u = o[q]
  3162. p[u[5]] = p[u[6]][u[3]]
  3163. q = q + 1
  3164. u = o[q]
  3165. p[u[5]][u[6]] = p[u[3]]
  3166. q = q + 1
  3167. u = o[q]
  3168. p[u[5]][u[6]] = u[3]
  3169. q = q + 1
  3170. u = o[q]
  3171. p[u[5]][u[6]] = u[3]
  3172. q = q + 1
  3173. u = o[q]
  3174. p[u[5]] = n[u[6]]
  3175. q = q + 1
  3176. u = o[q]
  3177. p[u[5]] = p[u[6]][u[3]]
  3178. q = q + 1
  3179. u = o[q]
  3180. p[u[5]] = u[6]
  3181. q = q + 1
  3182. u = o[q]
  3183. p[u[5]] = u[6]
  3184. q = q + 1
  3185. u = o[q]
  3186. p[u[5]] = u[6]
  3187. q = q + 1
  3188. u = o[q]
  3189. i = u[5]
  3190. p[i] = p[i](w(p, i + 1, u[6]))
  3191. q = q + 1
  3192. u = o[q]
  3193. p[u[5]][u[6]] = p[u[3]]
  3194. q = q + 1
  3195. u = o[q]
  3196. p[u[5]] = n[u[6]]
  3197. q = q + 1
  3198. u = o[q]
  3199. p[u[5]] = p[u[6]][u[3]]
  3200. q = q + 1
  3201. u = o[q]
  3202. p[u[5]] = p[u[6]][u[3]]
  3203. q = q + 1
  3204. u = o[q]
  3205. p[u[5]][u[6]] = p[u[3]]
  3206. q = q + 1
  3207. u = o[q]
  3208. p[u[5]] = n[u[6]]
  3209. q = q + 1
  3210. u = o[q]
  3211. p[u[5]] = p[u[6]][u[3]]
  3212. q = q + 1
  3213. u = o[q]
  3214. p[u[5]] = u[6]
  3215. q = q + 1
  3216. u = o[q]
  3217. p[u[5]] = u[6]
  3218. q = q + 1
  3219. u = o[q]
  3220. i = u[5]
  3221. p[i] = p[i](w(p, i + 1, u[6]))
  3222. q = q + 1
  3223. u = o[q]
  3224. p[u[5]][u[6]] = p[u[3]]
  3225. q = q + 1
  3226. u = o[q]
  3227. p[u[5]][u[6]] = u[3]
  3228. q = q + 1
  3229. u = o[q]
  3230. p[u[5]] = n[u[6]]
  3231. q = q + 1
  3232. u = o[q]
  3233. p[u[5]] = p[u[6]][u[3]]
  3234. q = q + 1
  3235. u = o[q]
  3236. p[u[5]] = u[6]
  3237. q = q + 1
  3238. u = o[q]
  3239. p[u[5]] = u[6]
  3240. q = q + 1
  3241. u = o[q]
  3242. p[u[5]] = u[6]
  3243. q = q + 1
  3244. u = o[q]
  3245. p[u[5]] = u[6]
  3246. q = q + 1
  3247. u = o[q]
  3248. i = u[5]
  3249. p[i] = p[i](w(p, i + 1, u[6]))
  3250. end
  3251. elseif a <= 116 then
  3252. if a > 115 then
  3253. p[u[5]][u[6]] = u[3]
  3254. else
  3255. q = p[u[5]] == p[u[3]] and u[6] or q + 1
  3256. end
  3257. elseif a <= 117 then
  3258. local a
  3259. local b
  3260. b = u[5]
  3261. p[b](w(p, b + 1, u[6]))
  3262. q = q + 1
  3263. u = o[q]
  3264. p[u[5]] = n[u[6]]
  3265. q = q + 1
  3266. u = o[q]
  3267. b = u[5]
  3268. a = p[u[6]]
  3269. p[b + 1] = a
  3270. p[b] = a[u[3]]
  3271. q = q + 1
  3272. u = o[q]
  3273. p[u[5]] = u[6]
  3274. q = q + 1
  3275. u = o[q]
  3276. b = u[5]
  3277. p[b] = p[b](w(p, b + 1, u[6]))
  3278. q = q + 1
  3279. u = o[q]
  3280. p[u[5]] = p[u[6]][u[3]]
  3281. q = q + 1
  3282. u = o[q]
  3283. b = u[5]
  3284. a = p[u[6]]
  3285. p[b + 1] = a
  3286. p[b] = a[u[3]]
  3287. elseif a == 118 then
  3288. m[u[6]] = p[u[5]]
  3289. else
  3290. do
  3291. return p[u[5]]
  3292. end
  3293. end
  3294. elseif a <= 124 then
  3295. if a <= 121 then
  3296. if a == 120 then
  3297. local a = u[5]
  3298. p[a] = p[a](w(p, a + 1, l))
  3299. else
  3300. p[u[5]] = u[6]
  3301. end
  3302. elseif a <= 122 then
  3303. local a = u[5]
  3304. p[a](w(p, a + 1, l))
  3305. elseif a == 123 then
  3306. local a
  3307. p[u[5]] = n[u[6]]
  3308. q = q + 1
  3309. u = o[q]
  3310. p[u[5]] = p[u[6]][u[3]]
  3311. q = q + 1
  3312. u = o[q]
  3313. p[u[5]] = u[6]
  3314. q = q + 1
  3315. u = o[q]
  3316. p[u[5]] = u[6]
  3317. q = q + 1
  3318. u = o[q]
  3319. p[u[5]] = u[6]
  3320. q = q + 1
  3321. u = o[q]
  3322. a = u[5]
  3323. p[a] = p[a](w(p, a + 1, u[6]))
  3324. q = q + 1
  3325. u = o[q]
  3326. p[u[5]][u[6]] = p[u[3]]
  3327. q = q + 1
  3328. u = o[q]
  3329. p[u[5]][u[6]] = u[3]
  3330. q = q + 1
  3331. u = o[q]
  3332. p[u[5]][u[6]] = u[3]
  3333. q = q + 1
  3334. u = o[q]
  3335. p[u[5]][u[6]] = u[3]
  3336. q = q + 1
  3337. u = o[q]
  3338. p[u[5]][u[6]] = u[3]
  3339. q = q + 1
  3340. u = o[q]
  3341. p[u[5]] = n[u[6]]
  3342. q = q + 1
  3343. u = o[q]
  3344. p[u[5]] = p[u[6]][u[3]]
  3345. q = q + 1
  3346. u = o[q]
  3347. p[u[5]] = u[6]
  3348. q = q + 1
  3349. u = o[q]
  3350. p[u[5]] = u[6]
  3351. q = q + 1
  3352. u = o[q]
  3353. p[u[5]] = u[6]
  3354. q = q + 1
  3355. u = o[q]
  3356. a = u[5]
  3357. p[a] = p[a](w(p, a + 1, u[6]))
  3358. q = q + 1
  3359. u = o[q]
  3360. p[u[5]][u[6]] = p[u[3]]
  3361. q = q + 1
  3362. u = o[q]
  3363. p[u[5]][u[6]] = u[3]
  3364. q = q + 1
  3365. u = o[q]
  3366. p[u[5]][u[6]] = u[3]
  3367. q = q + 1
  3368. u = o[q]
  3369. p[u[5]][u[6]] = u[3]
  3370. q = q + 1
  3371. u = o[q]
  3372. p[u[5]][u[6]] = u[3]
  3373. q = q + 1
  3374. u = o[q]
  3375. p[u[5]] = n[u[6]]
  3376. q = q + 1
  3377. u = o[q]
  3378. p[u[5]] = p[u[6]][u[3]]
  3379. q = q + 1
  3380. u = o[q]
  3381. p[u[5]] = u[6]
  3382. q = q + 1
  3383. u = o[q]
  3384. p[u[5]] = u[6]
  3385. q = q + 1
  3386. u = o[q]
  3387. p[u[5]] = u[6]
  3388. q = q + 1
  3389. u = o[q]
  3390. p[u[5]] = u[6]
  3391. q = q + 1
  3392. u = o[q]
  3393. a = u[5]
  3394. p[a] = p[a](w(p, a + 1, u[6]))
  3395. q = q + 1
  3396. u = o[q]
  3397. p[u[5]][u[6]] = p[u[3]]
  3398. q = q + 1
  3399. u = o[q]
  3400. p[u[5]][u[6]] = u[3]
  3401. q = q + 1
  3402. u = o[q]
  3403. p[u[5]][u[6]] = u[3]
  3404. q = q + 1
  3405. u = o[q]
  3406. p[u[5]] = n[u[6]]
  3407. q = q + 1
  3408. u = o[q]
  3409. p[u[5]] = p[u[6]][u[3]]
  3410. q = q + 1
  3411. u = o[q]
  3412. p[u[5]] = p[u[6]][u[3]]
  3413. q = q + 1
  3414. u = o[q]
  3415. p[u[5]][u[6]] = p[u[3]]
  3416. q = q + 1
  3417. u = o[q]
  3418. p[u[5]] = n[u[6]]
  3419. q = q + 1
  3420. u = o[q]
  3421. p[u[5]] = p[u[6]][u[3]]
  3422. q = q + 1
  3423. u = o[q]
  3424. p[u[5]] = p[u[6]][u[3]]
  3425. q = q + 1
  3426. u = o[q]
  3427. p[u[5]][u[6]] = p[u[3]]
  3428. q = q + 1
  3429. u = o[q]
  3430. p[u[5]] = {}
  3431. q = q + 1
  3432. u = o[q]
  3433. p[u[5]] = n[u[6]]
  3434. q = q + 1
  3435. u = o[q]
  3436. p[u[5]] = p[u[6]][u[3]]
  3437. q = q + 1
  3438. u = o[q]
  3439. p[u[5]] = p[u[6]][u[3]]
  3440. q = q + 1
  3441. u = o[q]
  3442. p[u[5]][u[6]] = p[u[3]]
  3443. q = q + 1
  3444. u = o[q]
  3445. p[u[5]] = n[u[6]]
  3446. q = q + 1
  3447. u = o[q]
  3448. p[u[5]] = p[u[6]][u[3]]
  3449. q = q + 1
  3450. u = o[q]
  3451. p[u[5]] = p[u[6]][u[3]]
  3452. q = q + 1
  3453. u = o[q]
  3454. p[u[5]][u[6]] = p[u[3]]
  3455. q = q + 1
  3456. u = o[q]
  3457. p[u[5]] = n[u[6]]
  3458. q = q + 1
  3459. u = o[q]
  3460. p[u[5]] = p[u[6]][u[3]]
  3461. q = q + 1
  3462. u = o[q]
  3463. p[u[5]] = p[u[6]][u[3]]
  3464. q = q + 1
  3465. u = o[q]
  3466. p[u[5]][u[6]] = p[u[3]]
  3467. q = q + 1
  3468. u = o[q]
  3469. p[u[5]][u[6]] = u[3]
  3470. q = q + 1
  3471. u = o[q]
  3472. p[u[5]][u[6]] = u[3]
  3473. q = q + 1
  3474. u = o[q]
  3475. p[u[5]] = n[u[6]]
  3476. q = q + 1
  3477. u = o[q]
  3478. p[u[5]] = p[u[6]][u[3]]
  3479. q = q + 1
  3480. u = o[q]
  3481. p[u[5]] = u[6]
  3482. q = q + 1
  3483. u = o[q]
  3484. p[u[5]] = u[6]
  3485. q = q + 1
  3486. u = o[q]
  3487. a = u[5]
  3488. p[a] = p[a](w(p, a + 1, u[6]))
  3489. q = q + 1
  3490. u = o[q]
  3491. p[u[5]][u[6]] = p[u[3]]
  3492. q = q + 1
  3493. u = o[q]
  3494. p[u[5]][u[6]] = u[3]
  3495. q = q + 1
  3496. u = o[q]
  3497. p[u[5]] = n[u[6]]
  3498. q = q + 1
  3499. u = o[q]
  3500. p[u[5]] = p[u[6]][u[3]]
  3501. q = q + 1
  3502. u = o[q]
  3503. p[u[5]] = p[u[6]][u[3]]
  3504. q = q + 1
  3505. u = o[q]
  3506. p[u[5]][u[6]] = p[u[3]]
  3507. q = q + 1
  3508. u = o[q]
  3509. p[u[5]][u[6]] = p[u[3]]
  3510. q = q + 1
  3511. u = o[q]
  3512. p[u[5]][u[6]] = p[u[3]]
  3513. q = q + 1
  3514. u = o[q]
  3515. p[u[5]] = {}
  3516. q = q + 1
  3517. u = o[q]
  3518. p[u[5]][u[6]] = u[3]
  3519. q = q + 1
  3520. u = o[q]
  3521. p[u[5]][u[6]] = u[3]
  3522. q = q + 1
  3523. u = o[q]
  3524. p[u[5]][u[6]] = u[3]
  3525. q = q + 1
  3526. u = o[q]
  3527. p[u[5]][u[6]] = u[3]
  3528. q = q + 1
  3529. u = o[q]
  3530. p[u[5]][u[6]] = u[3]
  3531. q = q + 1
  3532. u = o[q]
  3533. p[u[5]] = n[u[6]]
  3534. q = q + 1
  3535. u = o[q]
  3536. p[u[5]] = p[u[6]][u[3]]
  3537. q = q + 1
  3538. u = o[q]
  3539. p[u[5]] = u[6]
  3540. q = q + 1
  3541. u = o[q]
  3542. p[u[5]] = u[6]
  3543. q = q + 1
  3544. u = o[q]
  3545. a = u[5]
  3546. p[a] = p[a](w(p, a + 1, u[6]))
  3547. q = q + 1
  3548. u = o[q]
  3549. p[u[5]][u[6]] = p[u[3]]
  3550. else
  3551. local a = u[5]
  3552. p[a] = p[a](p[a + 1])
  3553. end
  3554. elseif a <= 126 then
  3555. if a > 125 then
  3556. m[u[6]] = p[u[5]]
  3557. else
  3558. local e
  3559. local c
  3560. local a
  3561. local h
  3562. local d, g, f, b
  3563. for a, c in v(k) do
  3564. for a, a in v(c[9]) do
  3565. d, g, f, b = {
  3566. c[a]:byte(1, #c[a])
  3567. }, '', u[5], u[6]
  3568. for a = 1, #d do
  3569. g, f = g..r(t(d[a], f)), (f + b) % s
  3570. end
  3571. c[a], c[9] = g, {}
  3572. end
  3573. end
  3574. q = q + 1
  3575. u = o[q]
  3576. h = u[5]
  3577. a = p[u[6]]
  3578. p[h + 1] = a
  3579. p[h] = a[u[3]]
  3580. q = q + 1
  3581. u = o[q]
  3582. p[u[5]] = u[6]
  3583. q = q + 1
  3584. u = o[q]
  3585. p[u[5]] = #p[u[6]]
  3586. q = q + 1
  3587. u = o[q]
  3588. h = u[5]
  3589. p[h] = p[h](w(p, h + 1, u[6]))
  3590. q = q + 1
  3591. u = o[q]
  3592. h = u[5]
  3593. a = p[u[6]]
  3594. p[h + 1] = a
  3595. p[h] = a[u[3]]
  3596. q = q + 1
  3597. u = o[q]
  3598. h = u[5]
  3599. p[h] = p[h](p[h + 1])
  3600. q = q + 1
  3601. u = o[q]
  3602. p[u[5]] = {}
  3603. q = q + 1
  3604. u = o[q]
  3605. p[u[5]][u[6]] = p[u[3]]
  3606. q = q + 1
  3607. u = o[q]
  3608. p[u[5]] = n[u[6]]
  3609. q = q + 1
  3610. u = o[q]
  3611. p[u[5]] = m[u[6]]
  3612. q = q + 1
  3613. u = o[q]
  3614. h = u[5]
  3615. c = {
  3616. p[h](p[h + 1])
  3617. }
  3618. e = 0
  3619. for a = h, u[3] do
  3620. e = e + 1
  3621. p[a] = c[e]
  3622. end
  3623. q = q + 1
  3624. u = o[q]
  3625. q = u[6]
  3626. end
  3627. elseif a <= 127 then
  3628. p[u[5]] = m[u[6]]
  3629. elseif a == 128 then
  3630. local a
  3631. local f
  3632. local c, d, e, b
  3633. p[u[5]] = m[u[6]]
  3634. q = q + 1
  3635. u = o[q]
  3636. for a, f in v(k) do
  3637. for a, a in v(f[9]) do
  3638. c, d, e, b = {
  3639. f[a]:byte(1, #f[a])
  3640. }, '', u[5], u[6]
  3641. for a = 1, #c do
  3642. d, e = d..r(t(c[a], e)), (e + b) % s
  3643. end
  3644. f[a], f[9] = d, {}
  3645. end
  3646. end
  3647. q = q + 1
  3648. u = o[q]
  3649. f = u[5]
  3650. a = p[u[6]]
  3651. p[f + 1] = a
  3652. p[f] = a[u[3]]
  3653. q = q + 1
  3654. u = o[q]
  3655. f = u[5]
  3656. p[f] = p[f](p[f + 1])
  3657. q = q + 1
  3658. u = o[q]
  3659. q = p[u[5]] == u[3] and u[6] or q + 1
  3660. else
  3661. q = p[u[5]] == u[3] and u[6] or q + 1
  3662. end
  3663. elseif a <= 138 then
  3664. if a <= 133 then
  3665. if a <= 131 then
  3666. if a == 130 then
  3667. p[u[5]] = (u[6] ~= 0)
  3668. q = q + 1
  3669. u = o[q]
  3670. m[u[6]] = p[u[5]]
  3671. q = q + 1
  3672. u = o[q]
  3673. p[u[5]] = m[u[6]]
  3674. q = q + 1
  3675. u = o[q]
  3676. do
  3677. return p[u[5]]
  3678. end
  3679. q = q + 1
  3680. u = o[q]
  3681. do
  3682. return
  3683. end
  3684. else
  3685. if (p[u[5]] < p[u[3]]) then
  3686. q = u[6]
  3687. else
  3688. q = q + 1
  3689. end
  3690. end
  3691. elseif a == 132 then
  3692. p[u[5]] = {}
  3693. else
  3694. q = p[u[5]] == p[u[3]] and q + 1 or u[6]
  3695. end
  3696. elseif a <= 135 then
  3697. if a > 134 then
  3698. local a
  3699. p[u[5]] = u[6]
  3700. q = q + 1
  3701. u = o[q]
  3702. p[u[5]] = u[6]
  3703. q = q + 1
  3704. u = o[q]
  3705. a = u[5]
  3706. p[a] = p[a](w(p, a + 1, u[6]))
  3707. q = q + 1
  3708. u = o[q]
  3709. p[u[5]] = #p[u[6]]
  3710. q = q + 1
  3711. u = o[q]
  3712. if (u[5] <= p[u[3]]) then
  3713. q = u[6]
  3714. else
  3715. q = q + 1
  3716. end
  3717. else
  3718. local b = u[5]
  3719. local a = {
  3720. p[b](w(p, b + 1, l))
  3721. }
  3722. local c = 0
  3723. for b = b, u[3] do
  3724. c = c + 1
  3725. p[b] = a[c]
  3726. end
  3727. end
  3728. elseif a <= 136 then
  3729. local a
  3730. local b
  3731. p[u[5]] = m[u[6]]
  3732. q = q + 1
  3733. u = o[q]
  3734. p[u[5]] = p[u[6]][p[u[3]]]
  3735. q = q + 1
  3736. u = o[q]
  3737. p[u[5]] = p[u[6]][u[3]]
  3738. q = q + 1
  3739. u = o[q]
  3740. b = u[5]
  3741. a = p[u[6]]
  3742. p[b + 1] = a
  3743. p[b] = a[u[3]]
  3744. q = q + 1
  3745. u = o[q]
  3746. p[u[5]] = u[6]
  3747. q = q + 1
  3748. u = o[q]
  3749. b = u[5]
  3750. p[b] = p[b](w(p, b + 1, u[6]))
  3751. q = q + 1
  3752. u = o[q]
  3753. p[u[5]] = p[u[6]][u[3]]
  3754. q = q + 1
  3755. u = o[q]
  3756. p[u[5]] = m[u[6]]
  3757. q = q + 1
  3758. u = o[q]
  3759. p[u[5]] = p[u[6]][u[3]]
  3760. q = q + 1
  3761. u = o[q]
  3762. b = u[5]
  3763. a = p[u[6]]
  3764. p[b + 1] = a
  3765. p[b] = a[u[3]]
  3766. q = q + 1
  3767. u = o[q]
  3768. p[u[5]] = n[u[6]]
  3769. q = q + 1
  3770. u = o[q]
  3771. p[u[5]] = p[u[6]][u[3]]
  3772. q = q + 1
  3773. u = o[q]
  3774. p[u[5]] = m[u[6]]
  3775. q = q + 1
  3776. u = o[q]
  3777. p[u[5]] = p[u[6]][u[3]]
  3778. q = q + 1
  3779. u = o[q]
  3780. p[u[5]] = u[6]
  3781. q = q + 1
  3782. u = o[q]
  3783. b = u[5]
  3784. p[b] = p[b](w(p, b + 1, u[6]))
  3785. q = q + 1
  3786. u = o[q]
  3787. p[u[5]] = m[u[6]]
  3788. q = q + 1
  3789. u = o[q]
  3790. p[u[5]] = p[u[6]][u[3]]
  3791. q = q + 1
  3792. u = o[q]
  3793. p[u[5]] = #p[u[6]]
  3794. q = q + 1
  3795. u = o[q]
  3796. b = u[5]
  3797. p[b] = p[b](w(p, b + 1, u[6]))
  3798. q = q + 1
  3799. u = o[q]
  3800. p[u[5]] = #p[u[6]]
  3801. q = q + 1
  3802. u = o[q]
  3803. if (u[5] <= p[u[3]]) then
  3804. q = q + 1
  3805. else
  3806. q = u[6]
  3807. end
  3808. elseif a > 137 then
  3809. if (u[5] < p[u[3]]) then
  3810. q = u[6]
  3811. else
  3812. q = q + 1
  3813. end
  3814. else
  3815. q = p[u[5]] and q + 1 or u[6]
  3816. end
  3817. elseif a <= 143 then
  3818. if a <= 140 then
  3819. if a > 139 then
  3820. local c = u[5]
  3821. local a = p[c + 2]
  3822. local b = p[c] + a
  3823. p[c] = b
  3824. if (a > 0) then
  3825. if (b <= p[c + 1]) then
  3826. q = u[6]
  3827. p[c + 3] = b
  3828. end
  3829. elseif (b >= p[c + 1]) then
  3830. q = u[6]
  3831. p[c + 3] = b
  3832. end
  3833. else
  3834. local b = u[5]
  3835. local d = {}
  3836. for a = 1, #h do
  3837. local c = h[a]
  3838. for a = 0, #c do
  3839. local c = c[a]
  3840. local a = c[1]
  3841. local e = c[2]
  3842. if a == p and e >= b then
  3843. d[e] = a[e]
  3844. c[1] = d
  3845. end
  3846. end
  3847. end
  3848. end
  3849. elseif a <= 141 then
  3850. p[u[5]][p[u[6]]] = p[u[3]]
  3851. elseif a == 142 then
  3852. p[u[5]] = n[u[6]]
  3853. else
  3854. local a = u[5]
  3855. local b = p[u[6]]
  3856. p[a + 1] = b
  3857. p[a] = b[u[3]]
  3858. end
  3859. elseif a <= 145 then
  3860. if a > 144 then
  3861. local a
  3862. local f
  3863. local g
  3864. local c, e, d, b
  3865. p[u[5]] = {}
  3866. q = q + 1
  3867. u = o[q]
  3868. p[u[5]] = {}
  3869. q = q + 1
  3870. u = o[q]
  3871. p[u[5]] = u[6]
  3872. q = q + 1
  3873. u = o[q]
  3874. p[u[5]] = u[6]
  3875. q = q + 1
  3876. u = o[q]
  3877. p[u[5]] = #p[u[6]]
  3878. q = q + 1
  3879. u = o[q]
  3880. p[u[5]] = u[6]
  3881. q = q + 1
  3882. u = o[q]
  3883. for a, f in v(k) do
  3884. for a, a in v(f[9]) do
  3885. c, e, d, b = {
  3886. f[a]:byte(1, #f[a])
  3887. }, '', u[5], u[6]
  3888. for a = 1, #c do
  3889. e, d = e..r(t(c[a], d)), (d + b) % s
  3890. end
  3891. f[a], f[9] = e, {}
  3892. end
  3893. end
  3894. q = q + 1
  3895. u = o[q]
  3896. g = u[5]
  3897. f = p[g]
  3898. a = p[g + 2]
  3899. if (a > 0) then
  3900. if (f > p[g + 1]) then
  3901. q = u[6]
  3902. else
  3903. p[g + 3] = f
  3904. end
  3905. elseif (f < p[g + 1]) then
  3906. q = u[6]
  3907. else
  3908. p[g + 3] = f
  3909. end
  3910. else
  3911. q = p[u[5]] == u[3] and q + 1 or u[6]
  3912. end
  3913. elseif a <= 146 then
  3914. p[u[5]][u[6]] = u[3]
  3915. elseif a > 147 then
  3916. if (u[5] < p[u[3]]) then
  3917. q = u[6]
  3918. else
  3919. q = q + 1
  3920. end
  3921. else
  3922. local d = u[5]
  3923. local a, b = j(p[d](p[d + 1]))
  3924. l = b + d - 1
  3925. local c = 0
  3926. for b = d, l do
  3927. c = c + 1
  3928. p[b] = a[c]
  3929. end
  3930. end
  3931. q = q + 1
  3932. end
  3933. end
  3934. end
  3935. return w({
  3936. i(d(), {}, b())()
  3937. }) or nil
  3938. end)(({
  3939. 1
  3940. })[1], ({
  3941. 1
  3942. })[1], 256, table.concat, {})
Add Comment
Please, Sign In to add comment