跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F1218. Iterated Linear Function

  • ID: 1224
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:进阶
  • 上传者:
  • 数学
  • 数论
  • 进阶
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

Iterated Linear Function

题目描述

D. Iterated Linear Function
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Consider a linear function f(x)=Ax+B. Let's define g(0)(x)=x and g(n)(x)=f(g(n-1)(x)) for n>0. For the given integer values A, B, n and x find the value of g(n)(x) modulo 109+7.

Input

The only line contains four integers A, B, n and x (1≤A,B,x≤109,1≤n≤1018) − the parameters from the problem statement.

Note that the given value n can be too large, so you should use 64-bit integer type to store it. In C++ you can use the long long integer type and in Java you can use long integer type.

Output

Print the only integer s − the value g(n)(x) modulo 109+7.

Examples
Input
3 4 1 1
Output
7
Input
3 4 2 1
Output
25
Input
3 4 3 1
Output
79


题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 699 题。保留原作者与原赛事署名。