AlgoUniversity
  • Go Back
Discussion
Number Formation :

Author

Akshay Sharma

Difficulty Level : Hard

Submissions : 503

Asked In : Zomato

Marks :100

: 8 | : 0

Given three integers X, Y and Z, your task is to find the sum of all the numbers formed having 4 at most X times, 5 at most Y times, and 6 at most Z times

Output the sum modulo ($$$10^9+7$$$)

Input

The first line of input contains three integer x,y,z. ($$$1 \le x,y,z \le 60$$$)

Output

Output the sum of all the numbers formed

Examples

Input
1 1 1
Output
3675
Input
0 0 0
Output
0

Note

For test case 1:

Explanation: 4 + 5 + 6 + 45 + 54 + 56 + 65 + 46 + 64 + 456 + 465 + 546 + 564 + 645 + 654 = 3675

You need to login to view your submissions.

You need to login to view all submissions.

Loading...

Result : Executed

Loading...

Feel something is wrong with the test cases?

Result : Accepted

Test Cases :

You need to Log In
We're glad that you want to attempt this problem!

But to Run or Submit the Problem, you need to Log In.

Continue to Log In
Challenge Submitted!

Your challenge has been submitted successfully.

You will get a response soon via WhatsApp or Email.

Challenge
Facing issue while trying to solve the problem! Don't worry, we got you covered!

Do let us know your issue.

Looks good!
Please enter your issue / feedback.

How do we get in touch with you?
Looks good!
Please enter your phone no.
Looks good!
Please enter your email address.