Problem: You are given two circles. Find the area of their intersection.

Input

The first line contains three integers x1, y1, r1 ( - 109 ≤ x1, y1 ≤ 109, 1 ≤ r1 ≤ 109) — the position of the center and the radius of the first circle.

The second line contains three integers x2, y2, r2 ( - 109 ≤ x2, y2 ≤ 109, 1 ≤ r2 ≤ 109) — the position of the center and the radius of the second circle.

Output

Print the area of the intersection of the circles. The answer will be considered correct if the absolute or relative error doesn't exceed 10 - 6.

Examples

Input

0 0 4
6 0 4


Output

7.25298806364175601379


Input

0 0 5
11 0 5


Output

0.00000000000000000000

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
long long GCD(long long a, long long b) { return b ? GCD(b, a % b) : a; }
int POW(int Base, int Exp) {
  int y, ret = 1;
  y = Base;
  while (Exp) {
    if (Exp & 1) ret = (ret * y) % 1000000007;
    y = (y * y) % 1000000007;
    Exp /= 2;
  }
  return ret % 1000000007;
}
vector<pair<int, pair<int, int> > > Rec;
vector<pair<unsigned long long, unsigned long long> > Rec1;
vector<pair<int, int> > SOB, D, P, Tot;
vector<int> A, B;
map<int, int> M;
vector<int>::iterator it;
int main() {
  long double PI = acos(-1.0);
  long double x1, y1, r1, x2, y2, r2, d;
  cin >> x1 >> y1 >> r1;
  cin >> x2 >> y2 >> r2;
  d = sqrt((x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1));
  cout.precision(9);
  if (d > r1 + r2) {
    cout << 0;
    return 0;
  }
  if (d <= abs(r2 - r1)) {
    long double r;
    r = (r1 >= r2) ? r2 : r1;
    cout << PI * r * r;
    return 0;
  }
  long double alpha, beta, ans1, ans2;
  alpha = acos((r1 * r1 + d * d - r2 * r2) / (2 * r1 * d)) * 2;
  beta = acos((r2 * r2 + d * d - r1 * r1) / (2 * r2 * d)) * 2;
  ans1 = (long double)(0.5 * beta * r2 * r2 - 0.5 * r2 * r2 * sin(beta));
  ans2 = (long double)(0.5 * alpha * r1 * r1 - 0.5 * r1 * r1 * sin(alpha));
  cout << ans1 + ans2;
}