## Algorithm

Chef appeared for a placement test.

There is a problem worth  points. Chef finds out that the problem has exactly 10 test cases. It is known that each test case is worth the same number of points.

Chef passes  test cases among them. Determine the score Chef will get.

NOTE: See sample explanation for more clarity.

### Input Format

• First line will contain , number of test cases. Then the test cases follow.
• Each test case contains of a single line of input, two integers  and , the total points for the problem and the number of test cases which pass for Chef's solution.

### Output Format

For each test case, output the points scored by Chef.

### Constraints

• 1≤�≤100
• 10≤�≤200
• 0≤�≤10
•  is a multiple of 10.

### Sample 1:

Input

Output

4
10 3
100 10
130 4
70 0

3
100
52
0


### Explanation:

Test Case 1: The problem is worth 10 points and since there are 10 test cases, each test case is worth 1 point. Since Chef passes 3 test cases, his score will be 1⋅3=3 points.

Test Case 2: The problem is worth 100 points and since there are 10 test cases, each test case is worth 10 points. Since Chef passes all the 10 test cases, his score will be 10⋅10=100 points.

Test Case 3: The problem is worth 130 points and since there are 10 test cases, each test case is worth 13 points. Since Chef passes 4 test cases, his score will be 13⋅4=52 points.

Test Case 4: The problem is worth 70 points and since there are 10 test cases, each test case is worth 7 points. Since Chef passes 0 test cases, his score will be 7⋅0=0 points.

## Code Examples

### #1 Code Example with C Programming

Code - C Programming

 #include<stdio.h>

int main(void) {
int t,x,n,p;
scanf("%d",&t);
while(t--)
{
scanf("%d %d",&x,&n);
p=(x/10)*n;
printf("%d\n",p);
}
return 0;
}.
Copy The Code &

Input

cmd
4
10 3
100 10
130 4
70 0

Output

cmd
3
100
52
0