```
from sage.all import *
from Crypto.Util.number import bytes_to_long, long_to_bytes, getPrime

def solve(m, e, n, c):
P.<x> = PolynomialRing(Zmod(n))
f = (m + x)^e - c
f = f.monic()
m = f.small_roots(epsilon=1/30)
print(long_to_bytes(int(m[0])))

n = 0x7e6a1e6b2e98af9067483629b3cbe204d251b81d6bc26e169a2bae14c3b7f682c0c3a50d373df3b281c5676db53422056b9442db547e4e3a96dd6276aaf538ef78f80702bad7d57e93f696962debc11803118bc8636e4aa2ccfe326800ae52c0eff7f5354a37b6cb883dab2b257ae2e76475783adcd9a16740be87cb27777e17
e = 7
c = 0x52308125663a67f608502c240323b039837735806197b60b9c8bab582f2eb7d2c6b2e51b7cc7e9d56ec900c6f5a11d964b096b437bad2002f4e299ca6afd2dbec78d9b1b5e58bd8d5c4bf918b23506ef8c9fb2f6282de8892d8adb8e6d09c3ec3538e0a5d9a1cd84506846e4f4c1aaef2ac9a03872df6cc7b262592e58351dab
pad = b'superpadding'
m = pad + b'\x00'*13
m = bytes_to_long(m)

solve(m, e, n, c)
```