Roll the Dice

Diana is playing a game with two dice. The first die has $m$ faces labelled $1, 2, 3, \ldots, m$. The second die has $n$ faces labelled $1, 2, 3, \ldots, n$. Write a program that determines how many ways she can roll the two dice so that the two faces add up to $10$.

Each way is an ordered pair made of one face value from the first die and one face value from the second die whose sum is exactly $10$. Two ways are considered different if either die shows a different value.

The input consists of two integers, each on its own line. The first line contains $m$ ($1 \le m \le 1000$), the number of faces on the first die. The second line contains $n$ ($1 \le n \le 1000$), the number of faces on the second die.

Print the number of ways to roll a sum of $10$ on the two dice. Use the singular word "way" when there is exactly one way and the plural word "ways" otherwise. For example, when there is exactly one way, print:

There is 1 way to get the sum 10.

Otherwise, print in the following form (with the count filled in):

There are 5 ways to get the sum 10.