#include<bits/stdc++.h> #define int long long using namespace std; void testread(){ freopen("test.in","r",stdin); freopen("test.out","w",stdout); } void testread2(){ freopen("sequence.in","r",stdin); freopen("sequence.out","w",stdout); } int n,t; const int mod=998244353; pair<int,int> a[300010],b[300010]; int pt[300010]; int flag[300010]; int dfs(int x,int step){ if(flag[x])return step; flag[x]=1; return dfs(pt[x],step+1); } signed main(){ //testread2(); cin>>n>>t; for(int i=1;i<=n;i++)cin>>a[i].first,a[i].second=i; for(int i=1;i<=n;i++)cin>>b[i].first,b[i].second=i; sort(a+1,a+1+n); sort(b+1,b+1+n); int ans=0; for(int i=1;i<=n;i++){ ans+=((a[i].first-b[i].first)*(a[i].first-b[i].first))%mod; ans%=mod; pt[a[i].second]=b[i].second; } cout<<ans<<' '; if(t==0)return 0; int move=0; for(int i=1;i<=n;i++){ if(!flag[i]){ move+=dfs(i,0)-1; } } cout<<move<<endl; return 0; }