### My issue

What algorithm should be used to solve this problem

### My code

```
#include <iostream>
#include <bits/stdc++.h>
#define rep(i,a,n) for(long long i=a;i<n;i++)
#define ll long long
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int n,x,y;
cin>>n>>x>>y;
int mul = x*y;
}
return 0;
}
```

Problem Link: COPS Problem - CodeChef