Problem: Once upon a time an old man and his wife lived by the great blue sea. One day the old man went fishing and caught a real live gold fish. The fish said: "Oh ye, old fisherman! Pray set me free to the ocean and I will grant you with n gifts, any gifts you wish!". Then the fish gave the old man a list of gifts and their prices. Some gifts on the list can have the same names but distinct prices. However, there can't be two gifts with the same names and the same prices. Also, there can be gifts with distinct names and the same prices. The old man can ask for n names of items from the list. If the fish's list has p occurrences of the given name, then the old man can't ask for this name of item more than p times.

The old man knows that if he asks for s gifts of the same name, the fish will randomly (i.e. uniformly amongst all possible choices) choose s gifts of distinct prices with such name from the list. The old man wants to please his greedy wife, so he will choose the n names in such a way that he can get n gifts with the maximum price. Besides, he isn't the brightest of fishermen, so if there are several such ways, he chooses one of them uniformly.

The old man wondered, what is the probability that he can get n most expensive gifts. As the old man isn't good at probability theory, he asks you to help him.

Input

The first line contains two space-separated integers n and m (1 ≤ n, m ≤ 1000) — the number of the old man's wishes and the number of distinct names in the goldfish's list, correspondingly. Then m lines follow: the i-th line first contains integer ki (ki > 0) — the number of distinct prices of gifts with the i-th name, then ki distinct space-separated integers cij (1 ≤ cij ≤ 109), the gifts' prices. 

It is guaranteed that the sum of all ki doesn't exceed 1000. It is guaranteed that n is not greater than the total number of the gifts.

Output

On a single line print one real number — the probability of getting n most valuable gifts. The answer will be considered correct if its absolute or relative error does not exceed 10 - 9.

Examples

Input

3 1
3 10 20 30


Output

1.000000000


Input

3 2
1 40
4 10 20 30 40


Output

0.166666667

Solution (in JAVA):

Solution:
import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.math.BigDecimal;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.StringTokenizer;

public class Solver {

	public static void main(String[] Args) throws NumberFormatException,
			IOException {
		new Solver().Run();
	}

	PrintWriter pw;
	StringTokenizer Stok;
	BufferedReader br;

	public String nextToken() throws IOException {
		while (Stok == null || !Stok.hasMoreTokens()) {
			Stok = new StringTokenizer(br.readLine());
		}
		return Stok.nextToken();
	}

	public int nextInt() throws NumberFormatException, IOException {
		return Integer.parseInt(nextToken());
	}

	public double nextDouble() throws NumberFormatException, IOException {
		return Double.parseDouble(nextToken());
	}

	public long nextLong() throws NumberFormatException, IOException {
		return Long.parseLong(nextToken());
	}

	class TDar implements Comparable<TDar>{
		
		int zn;
		int num;
		
		public TDar(int azn, int anum){
			zn=azn;
			num=anum;
		}

		@Override
		public int compareTo(TDar o) {
			return -this.zn+o.zn;
		}
	}
	
	int n,m, varkol,kol;
	int varnum;
	List<TDar> dars;
	int[] maxkol, minkol, varkols;
	
	double[] posscur, possnext; 
	double[] weightcur, weightnext;
	double mnchis, mnznam;
	
	public double calcC(int n, int k){
		double result=1;
		if (n==0 || k==0)
			return result;
		for (int i=n; i>n-k; i--){
			result*=i;
		}
		
		for (int i=2; i<=k; i++){
			result/=i;
		}
		return result;
	}
	
	public void Run() throws NumberFormatException, IOException {
		//br = new BufferedReader(new FileReader("input.txt")); pw = new PrintWriter("output.txt");
		br=new BufferedReader(new InputStreamReader(System.in));  pw=new PrintWriter(new OutputStreamWriter(System.out));
		
		n=nextInt();
		m=nextInt();
		dars=new ArrayList<Solver.TDar>();
		maxkol=new int[m];
		minkol=new int[m];
		varkols=new int[m];
		
		for (int i=0; i<m; i++){
			maxkol[i]=nextInt();
			for (int j=0; j<maxkol[i]; j++){
				dars.add(new TDar(nextInt(), i));
			}
		}
		
		Collections.sort(dars);
		varnum=dars.get(n-1).zn;
		int i=0;
		kol=dars.size();
		while (i<kol && dars.get(i).zn>varnum){
			minkol[dars.get(i).num]++;
			i++;
		}
		
		varkol=n-i;
		while (i<kol && dars.get(i).zn==varnum){
			varkols[dars.get(i).num]++;
			//varkol++;
			i++;
		}
		
		posscur=new double[varkol+1];
		possnext=new double[varkol+1];
		weightcur=new double[varkol+1];
		weightnext=new double[varkol+1];
		
		posscur[0]=1;
		weightcur[0]=1;
		
		for (int z=1; z<=m; z++){
			mnznam=calcC(maxkol[z-1], minkol[z-1]);
			mnchis=1;
			for (i=0; i<=varkols[z-1]; i++){
				if (i>=1){
					mnchis*=(varkols[z-1]+1-i);
					mnchis/=i;
					mnznam*=(maxkol[z-1]+1-minkol[z-1]-i);
					mnznam/=(minkol[z-1]+i);
				}
				for (int j=0; j+i<=varkol; j++){
					if (posscur[j]!=0){
						possnext[i+j]=possnext[i+j]+posscur[j]*weightcur[j]*mnchis/mnznam;
						weightnext[i+j]+=weightcur[j];
					}
				}
			}
			for (int j=0; j<=varkol; j++){
				if (weightnext[j]>0){
					possnext[j]/=weightnext[j];
				}
			}
			
			posscur=possnext;
			weightcur=weightnext;
			possnext=new double[varkol+1];
			weightnext=new double[varkol+1];
		}
		
		pw.println(posscur[varkol]);
		pw.flush();
		pw.close();
	}

}