Problem: Two neighbours, Alan and Bob, live in the city, where there are three buildings only: a cinema, a shop and the house, where they live. The rest is a big asphalt square. 

Once they went to the cinema, and the film impressed them so deeply, that when they left the cinema, they did not want to stop discussing it.

Bob wants to get home, but Alan has to go to the shop first, and only then go home. So, they agreed to cover some distance together discussing the film (their common path might pass through the shop, or they might walk circles around the cinema together), and then to part each other's company and go each his own way. After they part, they will start thinking about their daily pursuits; and even if they meet again, they won't be able to go on with the discussion. Thus, Bob's path will be a continuous curve, having the cinema and the house as its ends. Alan's path — a continuous curve, going through the shop, and having the cinema and the house as its ends.

The film ended late, that's why the whole distance covered by Alan should not differ from the shortest one by more than t1, and the distance covered by Bob should not differ from the shortest one by more than t2.

Find the maximum distance that Alan and Bob will cover together, discussing the film.

Input

The first line contains two integers: t1, t2 (0 ≤ t1, t2 ≤ 100). The second line contains the cinema's coordinates, the third one — the house's, and the last line — the shop's. 

All the coordinates are given in meters, are integer, and do not exceed 100 in absolute magnitude. No two given places are in the same building.

Output

In the only line output one number — the maximum distance that Alan and Bob will cover together, discussing the film. Output the answer accurate to not less than 4 decimal places.

Examples

Input

0 2
0 0
4 0
-3 0


Output

1.0000000000


Input

0 0
0 0
2 0
1 0


Output

2.0000000000

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
struct Vex {
  int x, y;
  Vex() {}
  Vex(int _x, int _y) : x(_x), y(_y) {}
  void scan() { scanf("%d%d", &x, &y); }
  friend double dis(const Vex &A, const Vex &B) {
    return sqrt((A.x - B.x) * (A.x - B.x) + (A.y - B.y) * (A.y - B.y));
  }
  friend bool CrossPoint(const Vex &A, double radA, const Vex &B, double radB,
                         double &pointx) {
    double l = sqrt((A.x - B.x) * (A.x - B.x) + (A.y - B.y) * (A.y - B.y));
    if (l > radA + radB + 1e-10) return false;
    double cos0 = (B.x - A.x) / l,
           cos1 = (radA * radA + l * l - radB * radB) / 2 / radA / l;
    pointx = A.x + radA * cos0 * cos1;
    return true;
  }
} V[3];
int t1, t2;
double R[3], disAB, disAC, disBC, ans;
inline bool check(double d) {
  R[0] = d, R[1] = disAC + t2 - d, R[2] = disAB + t1 - d;
  double l, r, mid;
  for (int i = 0; i < 3; ++i)
    if (!i)
      l = V[i].x - R[i], r = V[i].x + R[i];
    else {
      l = max(l, (double)V[i].x - R[i]);
      r = min(r, (double)V[i].x + R[i]);
    }
  if (l > r) return false;
  for (int times = 0; times < 30; ++times) {
    mid = (l + r) / 2;
    double up, low;
    int a, b;
    for (int i = 0; i < 3; ++i) {
      double delta = sqrt(R[i] * R[i] - (mid - V[i].x) * (mid - V[i].x));
      double u = V[i].y + delta, v = V[i].y - delta;
      if (!i || u < up) up = u, a = i;
      if (!i || v > low) low = v, b = i;
    }
    if (up + 1e-10 >= low) return true;
    double _x;
    if (!CrossPoint(V[a], R[a], V[b], R[b], _x)) return false;
    if (_x > mid)
      l = mid;
    else
      r = mid;
  }
  return false;
}
int main() {
  scanf("%d%d", &t1, &t2);
  for (int i = 0; i < 3; ++i) V[i].scan();
  disAB = dis(V[0], V[2]);
  disAC = dis(V[0], V[1]);
  disBC = dis(V[1], V[2]);
  ans = (disAB + disBC <= disAC + t2) ? min(disAB + disBC + t1, disAC + t2) : 0;
  double l = 0, r = disAC + t2, mid;
  for (int times = 0; times < 30; ++times) {
    mid = (l + r) / 2;
    if (check(mid))
      l = mid;
    else
      r = mid;
  }
  printf("%.6lf\n", max(ans, mid));
  return 0;
}