```
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 = 0xacd73d22c11ef7c7bcf661380cdc7934f77b808b5a60e351dc0cbdd4ac850dd7acda9bde6b391485d51948358cf9a8befccc92fcea63c4ddedaedcd8c5d34ba4f3c86de6f94238bb3593ff8a46c816d6103978ba97f0c4436218974771001d13d31c83913f9da162b1bd38ca63303f341bc205afe488194993c0977149a844ef
e = 3
c = 0x762a422e8fd1e511b13164179b1c4f9f707217d6fa1d4d6aa5d156239c35ef3417e7c195b7d28687dc4dcf595dadf45f9d8bc58199e877d7084c27fd3c18e30e6b1be193f6eb77f9891ad730cb9af902662ef590bb5c290af7da122f9fc357aff2b1315369dbc24c9524f159fb5aef088f8f1e9892ebc905967f7f5e05632211
m = b'first part of the flag: \x00\x00\x00\x00\x00\x00\x00 second part: \x00\x00\x00\x00\x00\x00\x00'
m = bytes_to_long(m)

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