import java.util.*; public class Main{ static final int MOD = (int)1e9+7; static final int MAX = 301; static int n; static int m; static int k; static ArrayList[] graph; static ArrayList[] complexity; static int[][][] memo; public static int dfs(int now, int cmp, int cnt){ if(cmp <= k && memo[now][cmp][cnt] != -1){ return memo[now][cmp][cnt]; } if(cnt == n || cmp > k){ //System.out.println(cnt + " : " + cmp); if(cnt == n && cmp == k){ return 1; }else{ return 0; } } int ret = 0; for(int i=0; i(); complexity[i] = new ArrayList<>(); } for(int i=0; i