Fibonacci numbers and their greatest common divisor

The Fibonacci numbers start with 0 and 1. The 0th Fibonacci number is 0, and the 1st is 1. From index 2 on, each number is the sum of the two before it.

Written as a formula, $F_n = F_{n-1} + F_{n-2}\ (n \ge 2)$.

The Fibonacci numbers up to $n = 17$ are:

0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597

Given $n$ and $m$, write a program that computes the greatest common divisor of the $n$th Fibonacci number and the $m$th Fibonacci number.

The first line contains $n$ and $m$, separated by a space. Both $n$ and $m$ are natural numbers no greater than $10^{18}$.

Print the greatest common divisor of the $n$th Fibonacci number and the $m$th Fibonacci number, modulo 1,000,000,007. Take the greatest common divisor of the actual Fibonacci numbers first, then reduce it modulo 1,000,000,007.