You are given two ints: N and K. Lun the dog is interested in the undirected graphs that satisfy the following conditions:
- The graph has exactly N vertices, labeled from 0 to N-1. Each vertex has a unique label.
- The graph has no loops (edges connected at both ends to the same vertex) and no more than one edge between any two different vertices.
- The graph has exactly K bridges (edges whose deletion increases its number of connected components).
Find and return the number of these graphs modulo 1,000,000,007.