Well I don't know how to solve it with a FFT, but you can solve it using Gaussian elimination ($\mathbb{Z}_{41}$ is a field, so that all works). First build the system of equations which asserts for every $i$ that $p(14^i) \equiv i \mod 41$, which looks like this (it has some sweet symmetry):
$
\left(
\begin{array}{cccccccc|c}
1 & 1 & 1 & 1 & 1 & 1 & 1 & 1 & 0 \\
1 & 14 & 32 & 38 & 40 & 27 & 9 & 3 & 1 \\
1 & 32 & 40 & 9 & 1 & 32 & 40 & 9 & 2 \\
1 & 38 & 9 & 14 & 40 & 3 & 32 & 27 & 3 \\
1 & 40 & 1 & 40 & 1 & 40 & 1 & 40 & 4 \\
1 & 27 & 32 & 3 & 40 & 14 & 9 & 38 & 5 \\
1 & 9 & 40 & 32 & 1 & 9 & 40 & 32 & 6 \\
1 & 3 & 9 & 27 & 40 & 38 & 32 & 14 & 7 \\
\end{array}
\right)
$
Then take the RREF (don't throw it in just any solver, it has to work with finite fields here and most assume reals), you get this
$
\left(
\begin{array}{cccccccc|c}
1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 24 \\
0 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 21 \\
0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 & 36 \\
0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 30 \\
0 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 20 \\
0 & 0 & 0 & 0 & 0 & 1 & 0 & 0 & 10 \\
0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 & 4 \\
0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 19 \\
\end{array}
\right)
$
So in the end the polynomial is $24 + 21x + 36x^2 + 30x^3 + 20x^4 + 10x^5 + 4x^6 + 19x^7$