Problem: You are going to work in Codeforces as an intern in a team of n engineers, numbered 1 through n. You want to give each engineer a souvenir: a T-shirt from your country (T-shirts are highly desirable in Codeforces). Unfortunately you don't know the size of the T-shirt each engineer fits in. There are m different sizes, numbered 1 through m, and each engineer will fit in a T-shirt of exactly one size.

You don't know the engineers' exact sizes, so you asked your friend, Gerald. Unfortunately, he wasn't able to obtain the exact sizes either, but he managed to obtain for each engineer i and for all sizes j, the probability that the size of the T-shirt that fits engineer i is j.

Since you're planning to give each engineer one T-shirt, you are going to bring with you exactly n T-shirts. For those n T-shirts, you can bring any combination of sizes (you can bring multiple T-shirts with the same size too!). You don't know the sizes of T-shirts for each engineer when deciding what sizes to bring, so you have to pick this combination based only on the probabilities given by your friend, Gerald. 

Your task is to maximize the expected number of engineers that receive a T-shirt of his size. 

This is defined more formally as follows. When you finally arrive at the office, you will ask each engineer his T-shirt size. Then, if you still have a T-shirt of that size, you will give him one of them. Otherwise, you don't give him a T-shirt. You will ask the engineers in order starting from engineer 1, then engineer 2, and so on until engineer n.

Input

The first line contains two space-separated integers n and m (1 ≤ n ≤ 3000, 1 ≤ m ≤ 300), denoting the number of engineers and the number of T-shirt sizes, respectively.

Then n lines follow, each line contains m space-separated integers. The j-th integer in the i-th line represents the probability that the i-th engineer fits in a T-shirt of size j. Each probability will be given as an integer between 0 and 1000, inclusive. The actual probability should be calculated as the given number divided by 1000. 

It is guaranteed that for any engineer, the sum of the probabilities for all m T-shirts is equal to one.

Output

Print a single real number denoting the maximum possible expected number of engineers that will receive a T-shirt.

For the answer the absolute or relative error of 10 - 9 is acceptable.

Examples

Input

2 2
500 500
500 500


Output

1.500000000000


Input

3 3
1000 0 0
1000 0 0
0 1000 0


Output

3.000000000000


Input

1 4
100 200 300 400


Output

0.400000000000

Note

For the first example, bring one T-shirt of each size. With 0.5 chance, either both engineers fit inside T-shirts of size 1 or both fit inside T-shirts of size 2. With the other 0.5 chance, one engineer fits inside a T-shirt of size 1 and the other inside a T-shirt of size 2. If the first is true, the number of engineers that receive a T-shirt is one. If the second is true, the number of such engineers is two. Hence, the expected number of engineers who receive a T-shirt is 1.5. This is maximum possible expected number of engineers for all sets of T-shirts. 

For the second example, bring two T-shirts of size 1 and one T-shirt of size 2. This way, each engineer will definitely receive a T-shirt of his size.

For the third example, bring one T-shirt of size 4.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int maxn = 3005;
const int maxm = 305;
int n, m;
double A[maxn][maxm], g[maxm][2][maxn], last[maxm], sumv[maxm], sump[maxm];
void Init() {
  for (int i = 1; i <= m; ++i) g[i][0][0] = 1.0;
  for (int t = 1; t <= m; ++t) {
    for (int i = 1; i <= n; ++i) {
      g[t][0][i] = g[t][0][i - 1] * (1.0 - A[i][t]);
    }
    sump[t] = g[t][0][n];
  }
}
double DP(int x, int y) {
  int la, no;
  if (y & 1)
    la = 0, no = 1;
  else
    la = 1, no = 0;
  for (int i = 1; i <= n; ++i) {
    g[x][no][i] = g[x][la][i - 1] * A[i][x] + g[x][no][i - 1] * (1.0 - A[i][x]);
  }
  memset(g[x][la], 0, sizeof(g[x][la]));
  sump[x] += 1.0 * g[x][no][n];
  sumv[x] += 1.0 * g[x][no][n] * y;
  double res = sumv[x] + (1.0 - sump[x]) * y, tmp = last[x];
  last[x] = res;
  return res - tmp;
}
struct Node {
  int x, y;
  double val;
  Node(int _x, int _y, double _val) {
    x = _x;
    y = _y;
    val = _val;
  }
  Node() { ; }
};
bool operator<(const Node &a, const Node &b) { return a.val < b.val; }
priority_queue<Node> Q;
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= m; ++j) {
      scanf("%lf", &A[i][j]);
      A[i][j] /= 1000.0;
    }
  }
  Init();
  for (int i = 1; i <= m; ++i) Q.push(Node(i, 1, DP(i, 1)));
  double ans = 0.0;
  for (int i = 1; i <= n; ++i) {
    Node f = Q.top();
    Q.pop();
    ans += f.val;
    Q.push(Node(f.x, f.y + 1, DP(f.x, f.y + 1)));
  }
  printf("%.15lf", ans);
  fclose(stdin);
  fclose(stdout);
  return 0;
}