#include using namespace std; #define lowbit(x) ((x)&(-x)) using u64 = unsigned long long; const int mod = 998244353; //2024 misaka; u64 n,a[1000015],t[1000015]; //2025 mikoto; void add(int x,int k) { for(int i=x;i<=n;i+=lowbit(i))t[i]+=k; } u64 qu(int l,int r) { u64 ans=0; for(int i=l-1;i>=1;i-=lowbit(i))ans-=t[i]; for(int i=r;i>=1;i-=lowbit(i))ans+=t[i]; return ans; } inline void solve() { cin>>n; u64 ans=0; for(int i=1;i<=n;i++) { cin>>a[i]; add(a[i],1); ans=(ans+a[i]-qu(1ull,a[i]));//sum=sum+c,c??(1,a[i])??????????a[i]??? ans=ans*max(n-i,1ull);//???sum=sum*base+c;?????????????sum=sum*base; } cout<