left[0]=a[0];
for(int i=1;i<=n-1;i++)
left[i]=(left[i-1]*a[i])%M;
right[n-1]=a[n-1];
for(int i=n-2;i>=0;i--)
right[i]=(right[i-1]*a[i])%M;
for query q
if(q==0)
return right[1]%M;
if(q==n-1)
return left[n-2]%M;
return (left[q-1]*right[q+1])%M;
Answer:
. . . . . . . S H A W T Y.. . .. . .
My phone duhhh. If I hadn’t had a phone I wouldn’t be able to send streaks...
That’s cool I’ll play the game tonight if I can
