def No_of_Triangle(N, K):
    if N < K:
        return 0
    upward = ((N - K + 1) * (N - K + 2)) // 2
    downward = ((N - 2*K + 1) * (N - 2*K + 2)) // 2 if N >= 2*K else 0
    return upward + downward