Submission #74710222

---

Source Code Expand

import sys
input = lambda: sys.stdin.readline().rstrip()
ii = lambda: int(input())
mii = lambda: map(int, input().split())
lii = lambda: list(mii())
inf = 1 << 64
mod = 998244353
def solve():
    n,m = mii()
    a = lii()
    b = lii()
    a1 = 0
    for i,x in enumerate(a):
        a1+=(i+1)*x
        a1%=mod
    b1 = sum(b)%mod
    ans1 = (a1*b1%mod)
    ans2 = 0
    pre = [0]
    for i in a:
        pre.append(pre[-1]+i)
    for j in range(1,m+1):
        x = j*b[j-1]
        d = 1
        k1 = 0
        for nj in range(j+j,n+2,j):
            k1+=d*(pre[nj-1]-pre[nj-j-1])
            k1%=mod
            d+=1
        kd = (n-j+1)
        mp = kd%j
        if mp>0 and mp<n:
            s = pre[-1]-pre[-1-mp]
            ans2+=s*x*d
        ans2+=x*k1
        ans2%=mod
    print((ans1-ans2)%mod)

t = 1
# t = ii()
for _ in range(t):
    solve()

Submission Info

Judge Result