Problem: Radewoosh is playing a computer game. There are n levels, numbered 1 through n. Levels are divided into k regions (groups). Each region contains some positive number of consecutive levels.

The game repeats the the following process:

  1. If all regions are beaten then the game ends immediately. Otherwise, the system finds the first region with at least one non-beaten level. Let X denote this region.
  2. The system creates an empty bag for tokens. Each token will represent one level and there may be many tokens representing the same level.
    * For each already beaten level i in the region X, the system adds ti tokens to the bag (tokens representing the i-th level). 
    * Let j denote the first non-beaten level in the region X. The system adds tj tokens to the bag. 
  3. Finally, the system takes a uniformly random token from the bag and a player starts the level represented by the token. A player spends one hour and beats the level, even if he has already beaten it in the past. 



Given n, k and values t1, t2, ..., tn, your task is to split levels into regions. Each level must belong to exactly one region, and each region must contain non-empty consecutive set of levels. What is the minimum possible expected number of hours required to finish the game?

Input

The first line of the input contains two integers n and k (1 ≤ n ≤ 200 000, 1 ≤ k ≤ min(50, n)) — the number of levels and the number of regions, respectively.

The second line contains n integers t1, t2, ..., tn (1 ≤ ti ≤ 100 000).

Output

Print one real number — the minimum possible expected value of the number of hours spent to finish the game if levels are distributed between regions in the optimal way. Your answer will be considered correct if its absolute or relative error does not exceed 10 - 4.

Namely: let's assume that your answer is a, and the answer of the jury is b. The checker program will consider your answer correct if <image>.

Examples

Input

4 2
100 3 5 7


Output

5.7428571429


Input

6 2
1 2 4 8 16 32


Output

8.5000000000

Note

In the first sample, we are supposed to split 4 levels into 2 regions. It's optimal to create the first region with only one level (it must be the first level). Then, the second region must contain other three levels.

In the second sample, it's optimal to split levels into two regions with 3 levels each.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int N = 200005;
const int K = 55;
int n, k;
int t[N];
double d[K][N];
double sum[N];
double rev[N];
double pref[N];
double add[N];
struct convex_hull_trick {
  int len;
  int uk;
  double k[N], b[N];
  convex_hull_trick() {
    uk = 1;
    len = 0;
  }
  void clear() {
    len = 0;
    uk = 1;
  }
  void add(double add, double coeff) {
    while (len >= 2 && (b[len] - b[len - 1]) * (k[len - 1] - coeff) <
                           (add - b[len - 1]) * (k[len - 1] - k[len]))
      --len;
    k[++len] = coeff;
    b[len] = add;
  }
  double get(double coeff) {
    uk = min(uk, len);
    while (uk + 1 <= len &&
           -coeff * k[uk] + b[uk] >= -coeff * k[uk + 1] + b[uk + 1])
      ++uk;
    return -coeff * k[uk] + b[uk];
  }
} l;
int main() {
  scanf("%d%d", &n, &k);
  for (int i = 1; i <= n; ++i) {
    scanf("%d", &t[i]);
    sum[i] = sum[i - 1] + double(t[i]);
    rev[i] = rev[i - 1] + (1 / double(t[i]));
    pref[i] = pref[i - 1] + sum[i] / t[i];
    add[i] = -pref[i] + sum[i] * rev[i];
  }
  for (int i = 0; i <= n; ++i)
    for (int j = 0; j <= k; ++j) d[j][i] = 1000000000000000000ll;
  d[0][0] = 0;
  for (int lvl = 1; lvl <= k; ++lvl) {
    l.clear();
    for (int i = lvl; i <= n; ++i) {
      l.add(d[lvl - 1][i - 1] + add[i - 1], sum[i - 1]);
      d[lvl][i] = pref[i] + l.get(rev[i]);
    }
  }
  printf("%.4f\n", (double)d[k][n]);
  return 0;
}