A plaintext message was converted into a string of 2-digit numbers using the following table (it has 99-10+1 = 90 entries):
```10: space	11: a	12: b	13: c	14: d	15: e	16: f	17: g	18: h	19: i
20: j		21: k	22: l	23: m	24: n	25: o	26: p	27: q	28: r	29: s
30: t		31: u	32: v	33: w	34: x	35: y	36: z	37: .	38: ,	39: ;
40: :		41: ?	42: !	43: (	44: )	45: \$	46: #	47: -	48: [	49: ]
50: 0		51: 1	52: 2	53: 3	54: 4	55: 5	56: 6	57: 7	58: 8	59: 9
60: +		61: =	62: %	63: ^	64: &	65: *	66: {	67: }	68: \	69: '
70: `		71: A	72: B	73: C	74: D	75: E	76: F	77: G	78: H	79: I
80: J		81: K	82: L	83: M	84: N	85: O	86: P	87: Q	88: R	89: S
90: T		91: U	92: V	93: W	94: X	95: Y	96: Z	97: <	98: >
99: carriage return (end of line)
```
These 2 digit numbers were then grouped into blocks of 6 digits, and encrypted using the formula
y = x^e (mod p)
with e = 419 and p = 1000003.
Here is the resulting ciphertext (read from left to right):
948304 913534 406831 170946 640247 749126 608213
466463 25475 437798 753670 826007 644383 996676
601514 876598 350224 699532 764265 344066 77804
To decrypt, you just need to apply the decryption formula:
x = y^d (mod p)
which you can do using the web forms here, but first you need to find the decryption exponent d by solving
de = 1 mod (p-1),
which you can also do using the web forms at the link above.

Problem [1]: Find the decryption exponent d if e = 419 and p = 1000003.

Problem [2]: Decrypt enough of the ciphertext to determine the source of the original plaintext message. (If you figure out the first four words but do not recognize the quote, google it.)