Simple Recursive Sequence The K-Fantastic Sequence Is Defined In The Following Way: (Ai+1=(K∗Bi+Ai∗Ai))Mod3001(Bi+1=(K∗Ai+I))Mod3001 Where A0=1 And B0=2

Simple recursive sequence The $\mathrm{K}$-fantastic sequence is defined in the following way: 

$\stackrel{{}^{(a_{i+1}}=\left(k\ast b_i+a_i\ast a_i\right))\mathrm{mod}3001}{{}^{({}^b}i+1=\left(k\ast a_i+{}_i\right))\mathrm{mod}3001}$ where $a_0=1$ and $b_0=2$ What is the $T^{\text{th }}$ pair of numbers of the K-fantastic sequence? Function description Complete the solve() function. This function takes the following 2 parameters and returns the answer: - $K$ : Represents an Integer denoting the value of $K$ - $T$ : Represents an Integer denoting the value of $T$ Input format for custom testing Note: Use this input format if you are testing against custom input or writing code in a language where we don't provide bollerplate code - The first line contains two space-separated integers denoting the value of $K$ and $T$. Output format Print $a_T$ and $b_T$. Constraints $\left(0\le K\le 30000\le T\le 10^9\right)$ Sample input $E$ Sample output 5 10 2601513 Explanation $0:12$ 1: 117 2: 15662 3: 638842 4: 1171031 5: 8381616 6: 20882805 7: 13121241 8: 19741799 9: 13702666 10: 2601513 vector Simple_Recursive_Sequence (int $K$, int $T$ ) \{ 1) Write your code here vector result $=\{[\theta ]=0\}$; return result; \} int $\mathrm{main}()\{$ ios: :sync_with_stdio(sync: 0$)$; cin.tie(tiestr: 0$)$; int $K$; cin $\gg \mathrm{K}$; int $\mathrm{T}$; cin $\gg \mathrm{T}$; ios: :sync_with_stdio(sync: 0$)$; cin.tie(tiestr: 0 ); int $\mathrm{K}$; cin $\gg \mathrm{K}$; int $T$; cin $\gg \mathrm{T}$; vector〈int> out_;

write a program(preferably in c++) for the same
needed urgently
don't copy from chatgpt or I'll downvote
run all the test cases