{"problem":{"name":"233 Matrix","description":{"content":"In our daily life we often use 233 to express our feelings. Actually, we may say 2333, 23333, or 233333 ... in the same meaning. And here is the question: Suppose we have a matrix called 233 matrix. I","description_type":"Markdown"},"platform":"Luogu","limit":{"time_limit":1000,"memory_limit":524288},"difficulty":{"LuoguStyle":"P4"},"is_remote":true,"is_sync":true,"sync_url":null,"sign":"LGP10503"},"statements":[{"statement_type":"Markdown","content":"In our daily life we often use 233 to express our feelings. Actually, we may say 2333, 23333, or 233333 ... in the same meaning. And here is the question: Suppose we have a matrix called 233 matrix. In the first line, it would be 233, 2333, 23333... (it means $a _ {0,1} = 233$, $a_{0,2} = 2333$, $a_{0,3} = 23333$...) Besides, in 233 matrix, we got $a_{i,j} = a_{i-1,j} +a_{i,j-1}( i,j \\neq 0)$. Now you have known $a_{1,0},a_{2,0},\\dots,a_{n,0}$, could you tell me $a_{n,m}$ in the 233 matrix?\n\n## Input\n\nThere are multiple test cases. Please process till EOF.\n\nFor each case, the first line contains two postive integers $n,m(n \\le 10,m \\le 10^9)$. The second line contains n integers, $a_{1,0},a_{2,0},...,a_{n,0}$ ($0 \\le a_{i,0} < 2^{31}$).\n\n## Output\n\nFor each case, output $a_{n,m}$ mod 10000007.\n\n[samples]\n\n## Note\n\n![](https://cdn.luogu.com.cn/upload/image_hosting/ndjcn0l1.png)","is_translate":false,"language":"English"}],"meta":{"iden":"LGP10503","tags":["O2优化","矩阵加速"],"sample_group":[["1 1\n1\n2 2\n0 0\n3 7\n23 47 16","234\n2799\n72937"]],"created_at":"2026-03-03 11:09:25"}}