The [Linear Congruential Generator (LCG)](https://en.wikipedia.org/wiki/Linear_congruential_generator) is one of the oldest pseudo random number generator functions.
The algorithm is as follows:
## Xn+1=(aXn + c) mod m
where:
* `a`/`A` is the multiplier (we'll be using `2`)
* `c`/`C` is the increment (we'll be using `3`)
* `m`/`M` is the modulus (we'll be using `10`)
X0 is the seed.
# Your task
Define a method `random`/`Random` in the class `LCG` that provides the next random number based on a seed. You never return the initial seed value.
Similar to [random](https://docs.python.org/3/library/random.html#random.random) return the result as a floating point number in the range `[0.0, 1.0)`
# Example
```python
# initialize the generator with seed = 5
LCG(5)
# first random number (seed = 5)
LCG.random() = 0.3      # (2 * 5 + 3) mod 10 = 3 --> return 0.3
# next random number (seed = 3)
LCG.random() = 0.9      # (2 * 3 + 3) mod 10 = 9 --> return 0.9
# next random number (seed = 9)
LCG.random() = 0.1
# next random number (seed = 1)
LCG.random() = 0.5
```
class LCG(object):
  a, c, m = 2, 3, 10
  
  def __init__(self, seed):
      self.current = seed
  
  def random(self):
      self.current = (self.a * self.current + self.c) % self.m
      return self.current / self.m
class LCG(object):
  a, c, m = 2, 3, 10
  
  def __init__(self, seed):
      self.current = seed
  
  def random(self):
      self.current = (self.a * self.current + self.c) % self.m
      return self.current / self.m