#include<bits/stdc++.h> #define int long long using namespace std; int n,t; pair<int,int>a[300005],b[300005]; int calc(){ int res=0; for(int i=1;i<=n;i++){ res+=(a[i].first-b[i].first)*(a[i].first-b[i].first)%998244353; res%=998244353; // cout<<res<<endl; } return res; } int p[300005]; bool vis[300005]; void dfs(int x){ if(vis[x])return; vis[x]=1; dfs(p[x]); } signed main(){ 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); cout<<calc()<<" "; if(!t)return 0; for(int i=1;i<=n;i++){ p[b[i].second]=a[i].second; } int ans=0; for(int i=1;i<=n;i++){ if(!vis[i])dfs(i),ans++; } cout<<n-ans<<endl; return 0; }