Scratch Card Redemption 1

1.0s 256M

A lottery company has introduced a new type of scratch card with the following rules:

Each scratch card has two numbers ranging from \(0\) to \(9\).

There are \(3\) types of prizes:

  • If the first number is odd, you win \(100\) yuan.
  • If the second number is \(2\), \(5\), or \(8\), you win \(200\) yuan.
  • If the first and second numbers are the same, you win \(50\) yuan.

If you qualify for at least \(2\) of the above prizes, you can only claim the highest prize.

Now, given the two numbers on a scratch card, what is the maximum prize you can receive?

Input

The input consists of two integers \(N\) and \(M\) in the range \(0\) to \(9\), representing the two numbers on the scratch card.

Output

Output the maximum prize you can receive from this scratch card; if you win nothing, output \(0\).

Sample Input 1

1 3

Sample Output 1

100

Sample Input 2

2 5

Sample Output 2

200

Problem page help

Keyboard shortcuts

Main features

  • Sample tests — Runs the sample cases bundled with the problem and auto-compares against the expected output.
  • Custom test — Run your code with your own stdin. Optionally tick the "Compare with expected (diff)" box to verify against expected output line-by-line.
  • Template — Paste the default code template you set on your profile page.
  • Collab — Edit this problem together with classmates in real time.
  • Auto-draft — Editor contents auto-save to your browser every 1.5 seconds (per account / problem / language).
  • Submit — Send your code to the judge for grading; returns AC / WA / TLE etc.

Limits

  • Source code: at most 65,536 characters
  • Custom test stdin and expected output: at most 1 MB each (≈1 million characters)
  • Custom test: about 1 request per 3 s per user (sample test: 1 per 1 s)
  • Custom test has a 15 second wall-clock cap; sample tests use the problem time limit, the same as the official judge
  • Interactive problems do not offer custom test (cannot simulate interaction with the judge).
  • Submitting has no rate limit, but rapid repeated submissions on the same problem are treated as score farming.