K Perfect Matchings

You are given a bipartite graph $G = (U, V , E)$, and an integer $K$. $U$ and $V$ are the two bipartitions of the graph such that |$U$| = |$V$| = $N$ , and $E$ is the edge set. The vertices of $U$ are {$1, 2, . . . , N$ } and that of $V$ are {$N + 1, N + 2, . . . , 2N$ }. You need to find out whether the total number of different perfect matchings in $G$ is strictly greater than $K$ or not. Recal