#include<cstdio>
#include<map>
using namespace std;
struct data{
    int many,color,number;
}a[100005];
map<int,int> map1,map2;
int m,n,sum,last;
int sum1,sum2;//数字相加,序号相加
int main(){
    scanf("%d%d",&n,&m);
    for(int i=0;i<n;i++){
        scanf("%d",&a[i].many);
        a[i].number=i+1;
    }
    for(int i=0;i<n;i++)
        scanf("%d",&a[i].color);
    for(int i=0;i<n;i+=2){
        for(int j=n-1-(n+1)%2;j>=0;j-=2){
            if(a[j].color==a[i].color){
                last=j;
                break; 
            }
        }
        if(last==i)
            continue;
        for(int j=i;j<last;j+=2){
            if(a[j].color==a[i].color){
                sum1+=a[j].many%10007;
                sum2+=a[j].number%10007;
                sum+=a[j].many*a[j].number%10007;
            }
        }
        sum+=a[last].many*a[last].number;//不加样例1过不了
        //printf("%d %d\n",sum1,sum2);
        sum+=sum1*a[last].number+sum2*a[last].many%10007;
        sum1=sum2=0;
    }
    //printf("%d\n",sum%10007);
    for(int i=1;i<n;i+=2){
        for(int j=n-1-n%2;j>0;j-=2){
            if(a[j].color==a[i].color){
                last=j;
                break; 
            }
        }
        if(last==i)
            continue;
        for(int j=i;j<last;j+=2){
            if(a[j].color==a[i].color){
                sum1+=a[j].many%10007;
                sum2+=a[j].number%10007;
                sum+=a[j].many*a[j].number%10007;
            }
        }
        sum+=a[last].many*a[last].number;
        //printf("%d %d\n",sum1,sum2);
        sum+=(sum1*a[last].number+sum2*a[last].many)%10007;
        sum1=sum2=0;
    }
    printf("%d\n",sum%10007);
    return 0;
}