#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

inline ll read() {
    ll sum = 0, ff = 1;
    char ch = getchar();
    while(ch < '0' || ch > '9') {
        if(ch == '-') {
            ff = -1;
        }
        ch = getchar();
    }
    while(ch >= '0' && ch <= '9') {
    	sum = sum * 10 + ch - 48;
        ch = getchar();
    }
    return sum * ff;
}

void write(ll x) {
	if(x < 0)
	    putchar('-'), x = -x;
	if(x > 9)
		write(x / 10);
	putchar(x % 10 + '0');
}

int a, b, c;

int main() {
//  	freopen(".in", "r", stdin);
//  	freopen(".out", "w", stdout);
	a = read(), b = read(), c = read();
	if(a * a + b * b < c * c)
		puts("Yes");
	else
		puts("No");
    return 0;
}

#include <iostream>
#include <algorithm>
using namespace std;

int main() {
	int N, K;
	cin >> N >> K;
	long long ans = 0;
	int abmin = max(2, K + 2);
	int abmax = min(2 * N, K + 2 * N);
	for (int ab = abmin; ab <= abmax; ab++) {
		long long abl = max(ab - N, 1);
		long long abr = min(N, ab-1);
		long long cdl = max(ab - K - N, 1);
		long long cdr = min(N, ab - K - 1);
		ans += (abr - abl + 1) * (cdr - cdl + 1);
	}
	cout << ans << endl;
}
