Package for this problem was not updated by the problem writer or Codeforces administration after we’ve upgraded the judging servers. To adjust the time limit constraint, solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then value 800 ms will be displayed and used to determine the verdict.

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

E. Square Equation Roots

time limit per test

5 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputA schoolboy Petya studies square equations. The equations that are included in the school curriculum, usually look simple:

Petya noticed that some equations have two real roots, some of them have only one root and some equations don't have real roots at all. Moreover it turned out that several different square equations can have a common root.

Petya is interested in how many different real roots have all the equations of the type described above for all the possible pairs of numbers *b* and *c* such that 1 ≤ *b* ≤ *n*, 1 ≤ *c* ≤ *m*. Help Petya find that number.

Input

The single line contains two integers *n* and *m*. (1 ≤ *n*, *m* ≤ 5000000).

Output

Print a single number which is the number of real roots of the described set of equations.

Examples

Input

3 3

Output

12

Input

1 2

Output

1

Note

In the second test from the statement the following equations are analysed:

*b* = 1, *c* = 1: *x*^{2} + 2*x* + 1 = 0; The root is *x* = - 1

*b* = 1, *c* = 2: *x*^{2} + 2*x* + 2 = 0; No roots

Overall there's one root

In the second test the following equations are analysed:

*b* = 1, *c* = 1: *x*^{2} + 2*x* + 1 = 0; The root is *x* = - 1

*b* = 1, *c* = 2: *x*^{2} + 2*x* + 2 = 0; No roots

*b* = 1, *c* = 3: *x*^{2} + 2*x* + 3 = 0; No roots

*b* = 2, *c* = 1: *x*^{2} + 4*x* + 1 = 0; The roots are

*b* = 2, *c* = 2: *x*^{2} + 4*x* + 2 = 0; The roots are

*b* = 2, *c* = 3: *x*^{2} + 4*x* + 3 = 0; The roots are *x*_{1} = - 3, *x*_{2} = - 1

*b* = 3, *c* = 1: *x*^{2} + 6*x* + 1 = 0; The roots are

*b* = 3, *c* = 2: *x*^{2} + 6*x* + 2 = 0; The roots are

*b* = 3, *c* = 3: *x*^{2} + 6*x* + 3 = 0; The roots are Overall there are 13 roots and as the root - 1 is repeated twice, that means there are 12 different roots.

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Mar/29/2017 18:00:53 (c4).

Desktop version, switch to mobile version.
User lists

Name |
---|