再学EXKMP（EXKMP模板）

#include<bits/stdc++.h>
using namespace std;

#define ll long long



int main(){
  ios::sync_with_stdio(false);
  cin.tie(0);
  string s1 ,s2 ;
  cin>>s1>>s2;
  vector<int>z(s1.length() + s2.length() );

  auto getz = [&](string s ){
    int l = 0 ;
    for(int i = 1; i < s.length() ; i ++){
      if(l + z[l] > i ){
        z[i] = min(z[i - l] , l + z[l] - i);
      }
      while(i + z[i] < s.length() && s[i + z[i]] == s[z[i]])z[i] ++;
      if(i + z[i] > l + z[l])l = i ;
    }
  };
  getz(s2 + s1);
  z[0] = s2.length() + 1;
  ll ansz = 0 ;

  for(int i = 0; i < s2.length() ; i ++){
    ansz ^= (ll)1*min((int)s2.length() - i + 1, (z[i] + 1) )*(i + 1);
  }
  ll ansp = 0;
  for(int i = 0 ; i < s1.length() ; i ++){
    ansp ^= (ll)1 * min((int)s2.length() + 1, z[i + s2.length()] + 1) *(i + 1);

  }
  cout<<ansz<<'\n'<<ansp<<'\n';
  return 0 ; 
}