Find five different integers a such that a≡3 (mod 6)

For a positive integer $n,$ two integers $a$ and $b$ are said to be congruent modulo $n$ (or $a$ is congruent to $b$ modulo $n$ ), if $a$ and $b$ have the same remainder when divided by $n$ (or equivalently if $a − b$ is divisible by $n$ ). It can be expressed as $a ≡ b \mod n.$

$a ≡ 3 \mod 6.$ Then $a − 3$ is divisible by $6.$

$a_1=9, a_2=15,a_3=21, a_4=27,a_5=33$