#include <bits/stdc++.h>
using namespace std;
const int mod = 10007;
const int maxn = 1e5 + 10;
int n, m;
long long a[maxn], b[maxn], num[maxn][2], sum[maxn][2], ans;
long long tmp;
int main(){
//freopen("input.txt", "r", stdin);
scanf("%d%d", &n, &m);
for(int i = 1; i <= n; i++) scanf("%lld", &a[i]);
for(int i = 1; i <= n; i++){
scanf("%lld", &b[i]);
num[b[i]][i%2]++;
sum[b[i]][i%2] = (sum[b[i]][i%2] + a[i]) % mod;
}
ans = 0;
for(int i = 1; i <= n; i++){
ans += (i*(sum[b[i]][i%2] + ((num[b[i]][i%2] - 2)*a[i])%mod))%mod,ans%=mod;
}
cout << ans << endl;
return 0;
}
/*
1 7 0
2 10 -10
3 9 -9
4 16 0
5 35 0
6 24 0
82
*/
这里其实有些奇怪的
把 a[i] 拆一个拆到了左边,加号右边搞成 -1 就是wa;现在这种写法搞成 -2 就是 AC