Permutation Combination question bank (Maths)

Let $\mathrm{S}=\{1,2,3,4,5,6,7,8,9\}$. Let $x$ be the number of 9 -digit numbers formed using the digits of the set S such that only one digit is repeated and it is repeated exactly twice. Let $y$ be the number of 9-digit numbers formed using the digits of the set S such that only two digits are repeated and each of these is repeated exactly twice. Then,

The number of numbers greater than 5000, less than 9000 and divisible by 3, that can be formed using the digits $0,1,2,5,9$, if the repetition of the digits is allowed, is $\_\_\_\_$