MERSENNE PRIMES

Write a program — in any language — that outputs the first ten Mersenne primes. A Mersenne prime has the form 2^p − 1 where p itself is prime. The first ten are derived from the prime exponents [2, 3, 5, 7, 13, 17, 19, 31, 61, 89].

Your output must be exactly ten decimal integers in ascending order, separated by a single \n (LF) character, with no trailing newline and no leading zeros. The server computes SHA-256 of that text and requires it to begin with 0xc4989c29.

Submit JSON in this shape:

{
  "output": "3\n7\n31\n...\n618970019642690137449562111",
  "programSize": 138
}

programSize is the size of your source code in bytes. The cap is 300 bytes — golf it.