Dotcpp  >  编程题库  >  I can do it!(I)
题目 2202:

I can do it!(I)

时间限制: 2Sec 内存限制: 512MB 提交: 29 解决: 1

题目描述

You have a recursive formula such as

I can do it!(I)

It is easy to calculate if n is smaller than 1000. But when n comes to 109, it may be hard to calculate the answer unless you can really computing!

I think you have this ability, so just do it!

But the answer may be to large to calculate, so you can only calculate the answer mod 1e9+7.

输入格式

The input consists of many test cases, but no more than 5 cases.

Each case will have three lines.

There are two integers n, k in the first line. k<n≤1010, 1≤k≤100

The second line has k numbers, and the i-th number is ai. |ai|≤109

The third line has k numbers too, and the i-th number is Fi|Fi|≤109

输出格式

For each test case, you should output a number describe the answer.

样例输入

83167 5
270044411 64763 389502790 165642235 3775223
136407894 699370879 998658047 184722627 -678977043
79679 3
427397619 485492671 476934139
-360282785 178718524 606397373

样例输出

299168603
559548063

提示

零基础的同学可以先学习基础,教程见:  C语言教程C++教程编译器教程数据结构教程Python教程单片机教程

视频教学见视频网课

标签

通过率

统 计

 提交 29
 正确 1
 格式错误 0
 答案错误 16
 时间超限 10
 内存超限 0
 输出超限 1
 运行错误 0
 编译错误 1