时间限制:C/C++/Rust/Pascal 1秒,其他语言2秒
空间限制:C/C++/Rust/Pascal 256 M,其他语言512 M
64bit IO Format: %lld
题目描述
NIO is a hacker who likes to crack passwords for fun.
But one day he forgot his password. He quickly listed some vague clues. There is a lowercase string

of length

and

lowercase strings

of length

. Given a uniform weight

represents the weight of each position of any

.
To figure out his password, for all

, he wants to find its maximum interval weight sum, and the string formed by this interval is a substring of

(An empty interval represents an empty string, which is legal).
输入描述:
The first line contains three positive integers
)
.
The second line contains a string

of length

.
The third line contains

integers
)
.
The next

lines represent the string

.
输出描述:
lines for
answers.
示例1
输入
复制
5 5 5
uqusa
-9 -7 8 -8 -3
saimh
qusam
qusaf
ubgxj
uquxw