| # chocolat | |
| ## Problem Description | |
| Balajiganapathi and Bipin are brothers. They have saved their money to buy Dairy Milk for their respective girlfriend on this Valentine's day. Balaji managed to buy M chocolates and Bipin managed to buy N chocolates. | |
| They have made a bet as if who will give more Dairy Milk to their girlfriend.If Bipin manages to give more chocolates then Bipin is considered as the winner, else Balaji is! | |
| NOTE: If they both buy same number of chocolates, there is no winner. | |
| Input | |
| The first line of the input contains an integer T denoting the number of test cases. The description of T test cases follows.Each line contains 2 integers- N and M-the number of chocolates they buy.. | |
| Output | |
| For each test case, output who wins the game and also by what margin does he win.(See the sample test cases) If there is a tie print "No Winner". | |
| Constraints | |
| 1 ≤ T ≤ 100 | |
| 1 ≤ M ≤ 100000 | |
| 1 ≤ N ≤ 100000 | |
| Example | |
| Input: | |
| 2 | |
| 4 6 | |
| 8 1 | |
| Output: | |
| Balaji 2 | |
| Bipin 7 | |
| ## Contest Information | |
| - **Contest ID**: 0 | |
| - **Problem Index**: | |
| - **Points**: 0.0 | |
| - **Rating**: 0 | |
| - **Tags**: None | |
| - **Time Limit**: None seconds | |
| - **Memory Limit**: 0 bytes | |
| ## Task | |
| Solve this competitive programming problem. Provide a complete solution that handles all the given constraints and edge cases. |