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 CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
using namespace rel_ops;
const double PI = acos((double)-1);
int ts, ts2, ts3, ts4;
int n, m;
long long gcd(long long x, long long y) {
  long long t;
  for (; y != 0;) {
    t = x % y;
    x = y;
    y = t;
  }
  return x;
}
long double sqr(double x) { return x * x; }
template <class T>
void mn(T& x, T y) {
  x = min(x, y);
}
template <class T>
void mx(T& x, T y) {
  x = max(x, y);
}
using namespace std;
long double jiec[2011];
long double C(int n, int m) { return exp(-jiec[n] + jiec[m] + jiec[n - m]); }
long double dp[1001][1001];
struct node {
  int col, data;
  friend bool operator<(node a, node b) { return a.data > b.data; }
} kuai[10001];
int ks[10001], cnt[10001], need[10001];
int main() {
  int kuai2 = 0;
  int i, j, k, l, t1, t2, t3, t4, t5, t6, t7, t8, t9, t, nw;
  int tt1, tt2, tt3, tt4;
  long double u1, u2, u3, u4, u5, u6, u7, u8, u9;
  char c1, c2, c3;
  scanf("%d%d", &n, &m);
  for (i = 1; i <= m; ++i) {
    scanf("%d", &k);
    ks[i] = k;
    for (j = 1; j <= k; ++j) {
      int a;
      scanf("%d", &a);
      kuai[kuai2++] = (node){i, a};
    }
  }
  sort(kuai, kuai + kuai2);
  for (i = 0; kuai[i].data != kuai[n - 1].data; ++i) cnt[kuai[i].col]++;
  int m2 = n - i;
  for (j = i; j < kuai2 && kuai[j].data == kuai[i].data; ++j)
    need[kuai[j].col]++;
  int n2 = j - i;
  for (i = 2; i <= kuai2; ++i) jiec[i] = jiec[i - 1] + log(i);
  kuai2 = 0;
  dp[0][0] = 1;
  for (i = 0; i < m; ++i) {
    long double c1 = C(ks[i + 1], cnt[i + 1]),
                c2 = C(ks[i + 1], cnt[i + 1] + 1);
    for (j = 0; j <= kuai2 && j <= m2; ++j) dp[i + 1][j] += dp[i][j] * c1;
    if (need[i + 1])
      for (j = 0; j <= kuai2 && j < m2; ++j)
        dp[i + 1][j + 1] += dp[i][j] * c2 * (m2 - j) / (n2 - j);
    kuai2 += need[i + 1];
  }
  printf("%.15lf\n", (double)dp[m][m2]);
  return 0;
}