Solve descrete log problem using meet in the middle attack.

More formally, write a program to compute discrete log modulo a prime p. Let g

be some element in Z

p and suppose you are given h in Z p such that h = gx where

1 ≤ x ≤ 240. Your goal is to find x. More precisely, the input to your program is p,g,h

and the output is x.