[{"sectionTitle":"题目描述","type":"Text","text":"大家都知道 Fibonacci 数列吧，$f_1=1,f_2=1,f_3=2,f_4=3,…,f_n=f_{n-1}+f_{n-2}$。\r\n\r\n现在问题很简单，输入 $n$ 和 $m$，求 $\\{f_n\\}$ 的前 $n$ 项和 $S_n\\bmod m$。","subType":"markdown"},{"sectionTitle":"输入格式","type":"Text","text":"输入 $n,m$。","subType":"markdown"},{"sectionTitle":"输出格式","type":"Text","text":"输出前 $n$ 项和 $S_n\\bmod m$。","subType":"markdown"},{"sectionTitle":"样例","type":"Sample","text":"","subType":"markdown","payload":["5 1000","12"]},{"sectionTitle":"数据范围与提示","type":"Text","text":"对于 $100\\%$ 的数据， $1\\le n \\le 2\\times 10^9, 1\\le m \\le 10^9+10$。","subType":"markdown"}]