有没有哪位大神帮忙扣下189邮箱登录的JS啊

佐佑少

大家新年快乐，有没有大神帮忙扣下189邮箱登录的JS啊   谢谢大家了

搁浅的爱

189.txt (88.47 KB, 下载次数: 27)

2021-2-16 19:54 上传

点击文件名下载附件 账号密码都是调用的同一个加密函数

knowledge

https://bbs.125.la/forum.php?mod ... 8&highlight=189      这有现成的

佐佑少

knowledge 发表于 2021-2-16 19:34
https://bbs.125.la/forum.php?mod=viewthread&tid=14451408&highlight=189      这有现成的

这是2019年的啊 还能用吗？     帐号密码全部是RSA加密啊

搁浅的爱

  

window = this;
navigator = {}; //如果需要用到浏览器协议头，请在<加载代码> 按钮 右侧选择 navigator.js
var JSEncryptExports = {};
! function (exports) {
function BigInteger (a, b, c) {
null != a && ("number" == typeof a ? this.fromNumber (a, b, c) : null == b && "string" != typeof a ? this.fromString (a, 256) : this.fromString (a, b))
}
function nbi () {
return new BigInteger (null)
}
function int2char (a) {
return BI_RM.charAt (a)
}
function intAt (a, b) {
var c = BI_RC[a.charCodeAt (b)];
return null == c ? -1 : c
}
function nbv (a) {
var b = nbi ();
return b.fromInt (a),
b
}
function nbits (a) {
var b, c = 1;
return 0 != (b = a >>> 16) && (a = b,
c += 16),
0 != (b = a >> 8) && (a = b,
c += 8),
0 != (b = a >> 4) && (a = b,
c += 4),
0 != (b = a >> 2) && (a = b,
c += 2),
0 != (b = a >> 1) && (a = b,
c += 1),
c
}
function Classic (a) {
this.m = a
}
function Montgomery (a) {
this.m = a,
this.mp = a.invDigit (),
this.mpl = 32767 & this.mp,
this.mph = this.mp >> 15,
this.um = (1 << a.DB - 15) - 1,
this.mt2 = 2 * a.t
}
function op_and (a, b) {
return a & b
}
function op_or (a, b) {
return a | b
}
function op_xor (a, b) {
return a ^ b
}
function op_andnot (a, b) {
return a & ~b
}
function lbit (a) {
if (0 == a) return -1;
var b = 0;
return 0 == (65535 & a) && (a >>= 16,
b += 16),
0 == (255 & a) && (a >>= 8,
b += 8),
0 == (15 & a) && (a >>= 4,
b += 4),
0 == (3 & a) && (a >>= 2,
b += 2),
0 == (1 & a) && ++b,
b
}
function cbit (a) {
for (var b = 0; 0 != a;)
a &= a - 1, ++b;
return b
}
function NullExp () {}
function nNop (a) {
return a
}
function Barrett (a) {
this.r2 = nbi (),
this.q3 = nbi (),
BigInteger.ONE.dlShiftTo (2 * a.t, this.r2),
this.mu = this.r2.divide (a),
this.m = a
}
function Arcfour () {
this.i = 0,
this.j = 0,
this.S = new Array
}
function rng_get_byte () {
if (null == rng_state) {
for (rng_state = new Arcfour; rng_pptr < rng_psize;) {
var a = Math.floor (65536 * Math.random ());
rng_pool[rng_pptr++] = 255 & a
}
for (rng_state.init (rng_pool),
rng_pptr = 0; rng_pptr < rng_pool.length; ++rng_pptr)
rng_pool[rng_pptr] = 0;
rng_pptr = 0
}
return rng_state.next ()
}
function SecureRandom () {}
function parseBigInt (a, b) {
return new BigInteger (a, b)
}
function RSAKey () {
this.n = null,
this.e = 0,
this.d = null,
this.p = null,
this.q = null,
this.dmp1 = null,
this.dmq1 = null,
this.coeff = null
}
function hex2b64 (a) {
var b, c, d = "";
for (b = 0; b + 3 <= a.length; b += 3)
c = parseInt (a.substring (b, b + 3), 16),
d += b64map.charAt (c >> 6) + b64map.charAt (63 & c);
for (b + 1 == a.length ? (c = parseInt (a.substring (b, b + 1), 16),
d += b64map.charAt (c << 2)) : b + 2 == a.length && (c = parseInt (a.substring (b, b + 2), 16),
d += b64map.charAt (c >> 2) + b64map.charAt ( (3 & c) << 4)); 0 < (3 & d.length);)
d += b64pad;
return d
}
function b64tohex (a) {
var b, c, d = "",
e = 0;
for (b = 0; b < a.length && a.charAt (b) != b64pad; ++b)
v = b64map.indexOf (a.charAt (b)),
v < 0 || (e = 0 == e ? (d += int2char (v >> 2),
c = 3 & v,
1) : 1 == e ? (d += int2char (c << 2 | v >> 4),
c = 15 & v,
2) : 2 == e ? (d += int2char (c),
d += int2char (v >> 2),
c = 3 & v,
3) : (d += int2char (c << 2 | v >> 4),
d += int2char (15 & v),
0));
return 1 == e && (d += int2char (c << 2)),
d
}
var dbits;
dbits = "Microsoft Internet Explorer" == navigator.appName ? (BigInteger.prototype.am = function (a, b, c, d, e, f) {
for (var g = 32767 & b, h = b >> 15; 0 <= --f;) {
var i = 32767 & this[a],
j = this[a++] >> 15,
k = h * i + j * g;
e = ( (i = g * i + ( (32767 & k) << 15) + c[d] + (1073741823 & e)) >>> 30) + (k >>> 15) + h * j + (e >>> 30),
c[d++] = 1073741823 & i
}
return e
},
30) : "Netscape" != navigator.appName ? (BigInteger.prototype.am = function (a, b, c, d, e, f) {
for (; 0 <= --f;) {
var g = b * this[a++] + c[d] + e;
e = Math.floor (g / 67108864),
c[d++] = 67108863 & g
}
return e
},
26) : (BigInteger.prototype.am = function (a, b, c, d, e, f) {
for (var g = 16383 & b, h = b >> 14; 0 <= --f;) {
var i = 16383 & this[a],
j = this[a++] >> 14,
k = h * i + j * g;
e = ( (i = g * i + ( (16383 & k) << 14) + c[d] + e) >> 28) + (k >> 14) + h * j,
c[d++] = 268435455 & i
}
return e
},
28),
BigInteger.prototype.DB = dbits,
BigInteger.prototype.DM = (1 << dbits) - 1,
BigInteger.prototype.DV = 1 << dbits;
BigInteger.prototype.FV = Math.pow (2, 52),
BigInteger.prototype.F1 = 52 - dbits,
BigInteger.prototype.F2 = 2 * dbits - 52;
var rr, vv, BI_RM = "0123456789abcdefghijklmnopqrstuvwxyz",
BI_RC = new Array;
for (rr = "0".charCodeAt (0),
vv = 0; vv <= 9; ++vv)
BI_RC[rr++] = vv;
for (rr = "a".charCodeAt (0),
vv = 10; vv < 36; ++vv)
BI_RC[rr++] = vv;
for (rr = "A".charCodeAt (0),
vv = 10; vv < 36; ++vv)
BI_RC[rr++] = vv;
Classic.prototype.convert = function (a) {
return a.s < 0 || 0 <= a.compareTo (this.m) ? a.mod (this.m) : a
},
Classic.prototype.revert = function (a) {
return a
},
Classic.prototype.reduce = function (a) {
a.divRemTo (this.m, null, a)
},
Classic.prototype.mulTo = function (a, b, c) {
a.multiplyTo (b, c),
this.reduce (c)
},
Classic.prototype.sqrTo = function (a, b) {
a.squareTo (b),
this.reduce (b)
},
Montgomery.prototype.convert = function (a) {
var b = nbi ();
return a.abs ().dlShiftTo (this.m.t, b),
b.divRemTo (this.m, null, b),
a.s < 0 && 0 < b.compareTo (BigInteger.ZERO) && this.m.subTo (b, b),
b
},
Montgomery.prototype.revert = function (a) {
var b = nbi ();
return a.copyTo (b),
this.reduce (b),
b
},
Montgomery.prototype.reduce = function (a) {
for (; a.t <= this.mt2;)
a[a.t++] = 0;
for (var b = 0; b < this.m.t; ++b) {
var c = 32767 & a[b],
d = c * this.mpl + ( (c * this.mph + (a[b] >> 15) * this.mpl & this.um) << 15) & a.DM;
for (a[c = b + this.m.t] += this.m.am (0, d, a, b, 0, this.m.t); a[c] >= a.DV;)
a[c] -= a.DV,
a[++c]++
}
a.clamp (),
a.drShiftTo (this.m.t, a),
0 <= a.compareTo (this.m) && a.subTo (this.m, a)
},
Montgomery.prototype.mulTo = function (a, b, c) {
a.multiplyTo (b, c),
this.reduce (c)
},
Montgomery.prototype.sqrTo = function (a, b) {
a.squareTo (b),
this.reduce (b)
},
BigInteger.prototype.copyTo = function (a) {
for (var b = this.t - 1; 0 <= b; --b)
a[b] = this[b];
a.t = this.t,
a.s = this.s
},
BigInteger.prototype.fromInt = function (a) {
this.t = 1,
this.s = a < 0 ? -1 : 0,
0 < a ? this[0] = a : a < -1 ? this[0] = a + DV : this.t = 0
},
BigInteger.prototype.fromString = function (a, b) {
var c;
if (16 == b) c = 4;
else if (8 == b) c = 3;
else if (256 == b) c = 8;
else if (2 == b) c = 1;
else if (32 == b) c = 5;
else {
if (4 != b) return void this.fromRadix (a, b);
c = 2
}
this.t = 0,
this.s = 0;
for (var d = a.length, e = !1, f = 0; 0 <= --d;) {
var g = 8 == c ? 255 & a[d] : intAt (a, d);
g < 0 ? "-" == a.charAt (d) && (e = !0) : (e = !1,
0 == f ? this[this.t++] = g : f + c > this.DB ? (this[this.t - 1] |= (g & (1 << this.DB - f) - 1) << f,
this[this.t++] = g >> this.DB - f) : this[this.t - 1] |= g << f, (f += c) >= this.DB && (f -= this.DB))
}
8 == c && 0 != (128 & a[0]) && (this.s = -1,
0 < f && (this[this.t - 1] |= (1 << this.DB - f) - 1 << f)),
this.clamp (),
e && BigInteger.ZERO.subTo (this, this)
},
BigInteger.prototype.clamp = function () {
for (var a = this.s & this.DM; 0 < this.t && this[this.t - 1] == a;)--this.t
},
BigInteger.prototype.dlShiftTo = function (a, b) {
var c;
for (c = this.t - 1; 0 <= c; --c)
b[c + a] = this[c];
for (c = a - 1; 0 <= c; --c)
b[c] = 0;
b.t = this.t + a,
b.s = this.s
},
BigInteger.prototype.drShiftTo = function (a, b) {
for (var c = a; c < this.t; ++c)
b[c - a] = this[c];
b.t = Math.max (this.t - a, 0),
b.s = this.s
},
BigInteger.prototype.lShiftTo = function (a, b) {
var c, d = a % this.DB,
e = this.DB - d,
f = (1 << e) - 1,
g = Math.floor (a / this.DB),
h = this.s << d & this.DM;
for (c = this.t - 1; 0 <= c; --c)
b[c + g + 1] = this[c] >> e | h,
h = (this[c] & f) << d;
for (c = g - 1; 0 <= c; --c)
b[c] = 0;
b[g] = h,
b.t = this.t + g + 1,
b.s = this.s,
b.clamp ()
},
BigInteger.prototype.rShiftTo = function (a, b) {
b.s = this.s;
var c = Math.floor (a / this.DB);
if (c >= this.t) b.t = 0;
else {
var d = a % this.DB,
e = this.DB - d,
f = (1 << d) - 1;
b[0] = this[c] >> d;
for (var g = c + 1; g < this.t; ++g)
b[g - c - 1] |= (this[g] & f) << e,
b[g - c] = this[g] >> d;
0 < d && (b[this.t - c - 1] |= (this.s & f) << e),
b.t = this.t - c,
b.clamp ()
}
},
BigInteger.prototype.subTo = function (a, b) {
for (var c = 0, d = 0, e = Math.min (a.t, this.t); c < e;)
d += this[c] - a[c],
b[c++] = d & this.DM,
d >>= this.DB;
if (a.t < this.t) {
for (d -= a.s; c < this.t;)
d += this[c],
b[c++] = d & this.DM,
d >>= this.DB;
d += this.s
} else {
for (d += this.s; c < a.t;)
d -= a[c],
b[c++] = d & this.DM,
d >>= this.DB;
d -= a.s
}
b.s = d < 0 ? -1 : 0,
d < -1 ? b[c++] = this.DV + d : 0 < d && (b[c++] = d),
b.t = c,
b.clamp ()
},
BigInteger.prototype.multiplyTo = function (a, b) {
var c = this.abs (),
d = a.abs (),
e = c.t;
for (b.t = e + d.t; 0 <= --e;)
b[e] = 0;
for (e = 0; e < d.t; ++e)
b[e + c.t] = c.am (0, d[e], b, e, 0, c.t);
b.s = 0,
b.clamp (),
this.s != a.s && BigInteger.ZERO.subTo (b, b)
},
BigInteger.prototype.squareTo = function (a) {
for (var b = this.abs (), c = a.t = 2 * b.t; 0 <= --c;)
a[c] = 0;
for (c = 0; c < b.t - 1; ++c) {
var d = b.am (c, b[c], a, 2 * c, 0, 1);
(a[c + b.t] += b.am (c + 1, 2 * b[c], a, 2 * c + 1, d, b.t - c - 1)) >= b.DV && (a[c + b.t] -=

window = this;<br /> navigator = {}; //如果需要用到浏览器协议头，请在<加载代码> 按钮 右侧选择 navigator.js<br /> var JSEncryptExports = {};<br /> ! function(exports) {<br />     function BigInteger(a, b, c) {<br />         null != a && ("number" == typeof a ? this.fromNumber(a, b, c) : null == b && "string" != typeof a ? this.fromString(a, 256) : this.fromString(a, b))<br />     }<br /> <br />     function nbi() {<br />         return new BigInteger(null)<br />     }<br /> <br />     function int2char(a) {<br />         return BI_RM.charAt(a)<br />     }<br /> <br />     function intAt(a, b) {<br />         var c = BI_RC[a.charCodeAt(b)];<br />         return null == c ? -1 : c<br />     }<br /> <br />     function nbv(a) {<br />         var b = nbi();<br />         return b.fromInt(a),<br />         b<br />     }<br /> <br />     function nbits(a) {<br />         var b, c = 1;<br />         return 0 != (b = a >>> 16) && (a = b,<br />         c += 16),<br />         0 != (b = a >> 8) && (a = b,<br />         c += 8),<br />         0 != (b = a >> 4) && (a = b,<br />         c += 4),<br />         0 != (b = a >> 2) && (a = b,<br />         c += 2),<br />         0 != (b = a >> 1) && (a = b,<br />         c += 1),<br />         c<br />     }<br /> <br />     function Classic(a) {<br />         this.m = a<br />     }<br /> <br />     function Montgomery(a) {<br />         this.m = a,<br />         this.mp = a.invDigit(),<br />         this.mpl = 32767 & this.mp,<br />         this.mph = this.mp >> 15,<br />         this.um = (1 << a.DB - 15) - 1,<br />         this.mt2 = 2 * a.t<br />     }<br /> <br />     function op_and(a, b) {<br />         return a & b<br />     }<br /> <br />     function op_or(a, b) {<br />         return a | b<br />     }<br /> <br />     function op_xor(a, b) {<br />         return a ^ b<br />     }<br /> <br />     function op_andnot(a, b) {<br />         return a & ~b<br />     }<br /> <br />     function lbit(a) {<br />         if (0 == a) return -1;<br />         var b = 0;<br />         return 0 == (65535 & a) && (a >>= 16,<br />         b += 16),<br />         0 == (255 & a) && (a >>= 8,<br />         b += 8),<br />         0 == (15 & a) && (a >>= 4,<br />         b += 4),<br />         0 == (3 & a) && (a >>= 2,<br />         b += 2),<br />         0 == (1 & a) && ++b,<br />         b<br />     }<br /> <br />     function cbit(a) {<br />         for (var b = 0; 0 != a;)<br />         a &= a - 1, ++b;<br />         return b<br />     }<br /> <br />     function NullExp() {}<br /> <br />     function nNop(a) {<br />         return a<br />     }<br /> <br />     function Barrett(a) {<br />         this.r2 = nbi(),<br />         this.q3 = nbi(),<br />         BigInteger.ONE.dlShiftTo(2 * a.t, this.r2),<br />         this.mu = this.r2.divide(a),<br />         this.m = a<br />     }<br /> <br />     function Arcfour() {<br />         this.i = 0,<br />         this.j = 0,<br />         this.S = new Array<br />     }<br /> <br />     function rng_get_byte() {<br />         if (null == rng_state) {<br />             for (rng_state = new Arcfour; rng_pptr < rng_psize;) {<br />                 var a = Math.floor(65536 * Math.random());<br />                 rng_pool[rng_pptr++] = 255 & a<br />             }<br />             for (rng_state.init(rng_pool),<br />             rng_pptr = 0; rng_pptr < rng_pool.length; ++rng_pptr)<br />             rng_pool[rng_pptr] = 0;<br />             rng_pptr = 0<br />         }<br />         return rng_state.next()<br />     }<br /> <br />     function SecureRandom() {}<br /> <br />     function parseBigInt(a, b) {<br />         return new BigInteger(a, b)<br />     }<br /> <br />     function RSAKey() {<br />         this.n = null,<br />         this.e = 0,<br />         this.d = null,<br />         this.p = null,<br />         this.q = null,<br />         this.dmp1 = null,<br />         this.dmq1 = null,<br />         this.coeff = null<br />     }<br /> <br />     function hex2b64(a) {<br />         var b, c, d = "";<br />         for (b = 0; b + 3 <= a.length; b += 3)<br />         c = parseInt(a.substring(b, b + 3), 16),<br />         d += b64map.charAt(c >> 6) + b64map.charAt(63 & c);<br />         for (b + 1 == a.length ? (c = parseInt(a.substring(b, b + 1), 16),<br />         d += b64map.charAt(c << 2)) : b + 2 == a.length && (c = parseInt(a.substring(b, b + 2), 16),<br />         d += b64map.charAt(c >> 2) + b64map.charAt((3 & c) << 4)); 0 < (3 & d.length);)<br />         d += b64pad;<br />         return d<br />     }<br /> <br />     function b64tohex(a) {<br />         var b, c, d = "",<br />             e = 0;<br />         for (b = 0; b < a.length && a.charAt(b) != b64pad; ++b)<br />         v = b64map.indexOf(a.charAt(b)),<br />         v < 0 || (e = 0 == e ? (d += int2char(v >> 2),<br />         c = 3 & v,<br />         1) : 1 == e ? (d += int2char(c << 2 | v >> 4),<br />         c = 15 & v,<br />         2) : 2 == e ? (d += int2char(c),<br />         d += int2char(v >> 2),<br />         c = 3 & v,<br />         3) : (d += int2char(c << 2 | v >> 4),<br />         d += int2char(15 & v),<br />         0));<br />         return 1 == e && (d += int2char(c << 2)),<br />         d<br />     }<br />     var dbits;<br />     dbits = "Microsoft Internet Explorer" == navigator.appName ? (BigInteger.prototype.am = function(a, b, c, d, e, f) {<br />         for (var g = 32767 & b, h = b >> 15; 0 <= --f;) {<br />             var i = 32767 & this[a],<br />                 j = this[a++] >> 15,<br />                 k = h * i + j * g;<br />             e = ((i = g * i + ((32767 & k) << 15) + c[d] + (1073741823 & e)) >>> 30) + (k >>> 15) + h * j + (e >>> 30),<br />             c[d++] = 1073741823 & i<br />         }<br />         return e<br />     },<br />     30) : "Netscape" != navigator.appName ? (BigInteger.prototype.am = function(a, b, c, d, e, f) {<br />         for (; 0 <= --f;) {<br />             var g = b * this[a++] + c[d] + e;<br />             e = Math.floor(g / 67108864),<br />             c[d++] = 67108863 & g<br />         }<br />         return e<br />     },<br />     26) : (BigInteger.prototype.am = function(a, b, c, d, e, f) {<br />         for (var g = 16383 & b, h = b >> 14; 0 <= --f;) {<br />             var i = 16383 & this[a],<br />                 j = this[a++] >> 14,<br />                 k = h * i + j * g;<br />             e = ((i = g * i + ((16383 & k) << 14) + c[d] + e) >> 28) + (k >> 14) + h * j,<br />             c[d++] = 268435455 & i<br />         }<br />         return e<br />     },<br />     28),<br />     BigInteger.prototype.DB = dbits,<br />     BigInteger.prototype.DM = (1 << dbits) - 1,<br />     BigInteger.prototype.DV = 1 << dbits;<br />     BigInteger.prototype.FV = Math.pow(2, 52),<br />     BigInteger.prototype.F1 = 52 - dbits,<br />     BigInteger.prototype.F2 = 2 * dbits - 52;<br />     var rr, vv, BI_RM = "0123456789abcdefghijklmnopqrstuvwxyz",<br />         BI_RC = new Array;<br />     for (rr = "0".charCodeAt(0),<br />     vv = 0; vv <= 9; ++vv)<br />     BI_RC[rr++] = vv;<br />     for (rr = "a".charCodeAt(0),<br />     vv = 10; vv < 36; ++vv)<br />     BI_RC[rr++] = vv;<br />     for (rr = "A".charCodeAt(0),<br />     vv = 10; vv < 36; ++vv)<br />     BI_RC[rr++] = vv;<br />     Classic.prototype.convert = function(a) {<br />         return a.s < 0 || 0 <= a.compareTo(this.m) ? a.mod(this.m) : a<br />     },<br />     Classic.prototype.revert = function(a) {<br />         return a<br />     },<br />     Classic.prototype.reduce = function(a) {<br />         a.divRemTo(this.m, null, a)<br />     },<br />     Classic.prototype.mulTo = function(a, b, c) {<br />         a.multiplyTo(b, c),<br />         this.reduce(c)<br />     },<br />     Classic.prototype.sqrTo = function(a, b) {<br />         a.squareTo(b),<br />         this.reduce(b)<br />     },<br />     Montgomery.prototype.convert = function(a) {<br />         var b = nbi();<br />         return a.abs().dlShiftTo(this.m.t, b),<br />         b.divRemTo(this.m, null, b),<br />         a.s < 0 && 0 < b.compareTo(BigInteger.ZERO) && this.m.subTo(b, b),<br />         b<br />     },<br />     Montgomery.prototype.revert = function(a) {<br />         var b = nbi();<br />         return a.copyTo(b),<br />         this.reduce(b),<br />         b<br />     },<br />     Montgomery.prototype.reduce = function(a) {<br />         for (; a.t <= this.mt2;)<br />         a[a.t++] = 0;<br />         for (var b = 0; b < this.m.t; ++b) {<br />             var c = 32767 & a<strong>,<br />                 d = c * this.mpl + ((c * this.mph + (a<strong> >> 15) * this.mpl & this.um) << 15) & a.DM;<br />             for (a[c = b + this.m.t] += this.m.am(0, d, a, b, 0, this.m.t); a[c] >= a.DV;)<br />             a[c] -= a.DV,<br />             a[++c]++<br />         }<br />         a.clamp(),<br />         a.drShiftTo(this.m.t, a),<br />         0 <= a.compareTo(this.m) && a.subTo(this.m, a)<br />     },<br />     Montgomery.prototype.mulTo = function(a, b, c) {<br />         a.multiplyTo(b, c),<br />         this.reduce(c)<br />     },<br />     Montgomery.prototype.sqrTo = function(a, b) {<br />         a.squareTo(b),<br />         this.reduce(b)<br />     },<br />     BigInteger.prototype.copyTo = function(a) {<br />         for (var b = this.t - 1; 0 <= b; --b)<br />         a<strong> = this<strong>;<br />         a.t = this.t,<br />         a.s = this.s<br />     },<br />     BigInteger.prototype.fromInt = function(a) {<br />         this.t = 1,<br />         this.s = a < 0 ? -1 : 0,<br />         0 < a ? this[0] = a : a < -1 ? this[0] = a + DV : this.t = 0<br />     },<br />     BigInteger.prototype.fromString = function(a, b) {<br />         var c;<br />         if (16 == b) c = 4;<br />         else if (8 == b) c = 3;<br />         else if (256 == b) c = 8;<br />         else if (2 == b) c = 1;<br />         else if (32 == b) c = 5;<br />         else {<br />             if (4 != b) return void this.fromRadix(a, b);<br />             c = 2<br />         }<br />         this.t = 0,<br />         this.s = 0;<br />         for (var d = a.length, e = !1, f = 0; 0 <= --d;) {<br />             var g = 8 == c ? 255 & a[d] : intAt(a, d);<br />             g < 0 ? "-" == a.charAt(d) && (e = !0) : (e = !1,<br />             0 == f ? this[this.t++] = g : f + c > this.DB ? (this[this.t - 1] |= (g & (1 << this.DB - f) - 1) << f,<br />             this[this.t++] = g >> this.DB - f) : this[this.t - 1] |= g << f, (f += c) >= this.DB && (f -= this.DB))<br />         }<br />         8 == c && 0 != (128 & a[0]) && (this.s = -1,<br />         0 < f && (this[this.t - 1] |= (1 << this.DB - f) - 1 << f)),<br />         this.clamp(),<br />         e && BigInteger.ZERO.subTo(this, this)<br />     },<br />     BigInteger.prototype.clamp = function() {<br />         for (var a = this.s & this.DM; 0 < this.t && this[this.t - 1] == a;)--this.t<br />     },<br />     BigInteger.prototype.dlShiftTo = function(a, b) {<br />         var c;<br />         for (c = this.t - 1; 0 <= c; --c)<br />         b[c + a] = this[c];<br />         for (c = a - 1; 0 <= c; --c)<br />         b[c] = 0;<br />         b.t = this.t + a,<br />         b.s = this.s<br />     },<br />     BigInteger.prototype.drShiftTo = function(a, b) {<br />         for (var c = a; c < this.t; ++c)<br />         b[c - a] = this[c];<br />         b.t = Math.max(this.t - a, 0),<br />         b.s = this.s<br />     },<br />     BigInteger.prototype.lShiftTo = function(a, b) {<br />         var c, d = a % this.DB,<br />             e = this.DB - d,<br />             f = (1 << e) - 1,<br />             g = Math.floor(a / this.DB),<br />             h = this.s << d & this.DM;<br />         for (c = this.t - 1; 0 <= c; --c)<br />         b[c + g + 1] = this[c] >> e | h,<br />         h = (this[c] & f) << d;<br />         for (c = g - 1; 0 <= c; --c)<br />         b[c] = 0;<br />         b[g] = h,<br />         b.t = this.t + g + 1,<br />         b.s = this.s,<br />         b.clamp()<br />     },<br />     BigInteger.prototype.rShiftTo = function(a, b) {<br />         b.s = this.s;<br />         var c = Math.floor(a / this.DB);<br />         if (c >= this.t) b.t = 0;<br />         else {<br />             var d = a % this.DB,<br />                 e = this.DB - d,<br />                 f = (1 << d) - 1;<br />             b[0] = this[c] >> d;<br />             for (var g = c + 1; g < this.t; ++g)<br />             b[g - c - 1] |= (this[g] & f) << e,<br />             b[g - c] = this[g] >> d;<br />             0 < d && (b[this.t - c - 1] |= (this.s & f) << e),<br />             b.t = this.t - c,<br />             b.clamp()<br />         }<br />     },<br />     BigInteger.prototype.subTo = function(a, b) {<br />         for (var c = 0, d = 0, e = Math.min(a.t, this.t); c < e;)<br />         d += this[c] - a[c],<br />         b[c++] = d & this.DM,<br />         d >>= this.DB;<br />         if (a.t < this.t) {<br />             for (d -= a.s; c < this.t;)<br />             d += this[c],<br />             b[c++] = d & this.DM,<br />             d >>= this.DB;<br />             d += this.s<br />         } else {<br />             for (d += this.s; c < a.t;)<br />             d -= a[c],<br />             b[c++] = d & this.DM,<br />             d >>= this.DB;<br />             d -= a.s<br />         }<br />         b.s = d < 0 ? -1 : 0,<br />         d < -1 ? b[c++] = this.DV + d : 0 < d && (b[c++] = d),<br />         b.t = c,<br />         b.clamp()<br />     },<br />     BigInteger.prototype.multiplyTo = function(a, b) {<br />         var c = this.abs(),<br />             d = a.abs(),<br />             e = c.t;<br />         for (b.t = e + d.t; 0 <= --e;)<br />         b[e] = 0;<br />         for (e = 0; e < d.t; ++e)<br />         b[e + c.t] = c.am(0, d[e], b, e, 0, c.t);<br />         b.s = 0,<br />         b.clamp(),<br />         this.s != a.s && BigInteger.ZERO.subTo(b, b)<br />     },<br />     BigInteger.prototype.squareTo = function(a) {<br />         for (var b = this.abs(), c = a.t = 2 * b.t; 0 <= --c;)<br />         a[c] = 0;<br />         for (c = 0; c < b.t - 1; ++c) {<br />             var d = b.am(c, b[c], a, 2 * c, 0, 1);<br />             (a[c + b.t] += b.am(c + 1, 2 * b[c], a, 2 * c + 1, d, b.t - c - 1)) >= b.DV && (a[c + b.t] -=