Consider the problem of *permanent verification*:  

$\bullet \ $ Given a $n\times n$ matrix $A$ with entries in $\{0,1\}$, and given $k\ge 0$, does $Per(A)=k$?  

**Question:** Is it known to be NP-hard?  Should one expect this problem to be in C$_{=}$P-complete?  (or maybe this is also already known?)

P.S.  I might be naive and this is super easy, but excessive googling did not show anything.