#include <cstdio>#include <cstring>#include <algorithm>using namespace std;int T, n, ct;long long p[100005], w[100005][2], s[100005], dis[100005],minn[100005];int main(){scanf("%d",&T);for (int oi = 0; oi < T; ++oi){scanf("%d%d",&n,&ct);long long t1, t2, t3;for (int i = 1; i <= n; ++i){scanf("%lld%lld%lld",&t1,&t2,&t3);p[i] = t3;s[i] = t1*t2;}dis[0] = 0;for (int i = 1; i <= n; ++i)dis[i] = dis[i-1]+s[i];int r = 0;for (int i = n; i > 0; --i){r++;w[r][0] = i;w[r][1] = p[i];while (r>1&& (w[r][1] < w[r-1][1] || dis[w[r-1][0]-1]-dis[i-1]>ct)){w[r-1][0] = w[r][0];w[r-1][1] = w[r][1];r--;}if (r>1) minn[i] = w[r-1][0];else minn[i] = i;}bool flag = false;for (int i = 1; i <= n; ++i)if (s[i] > ct) {printf("Impossiblen");flag = true;break;}if (flag) continue;long long gas = 0,cost = 0,k = 1;while(k <= n){if (minn[k] != k){long long tp = dis[minn[k]-1]-dis[k-1]-gas;if (tp <0) tp = 0;cost += tp*p[k];if (dis[minn[k]-1]-dis[k-1]-gas <0) gas = gas+dis[k-1]-dis[minn[k]-1];else gas = 0;k = minn[k];}else {if(dis[n] - dis[k-1] > ct){cost += (ct-gas)*p[k];gas = ct - s[k];k++;}else {cost += (dis[n]-dis[k-1]-gas)*p[k];k = n+1;}}}printf("%lldn",cost);}}
