HDU-1005

import java.math.BigInteger;
import java.util.Scanner;

public class Number_Sequence {
	public static void main(String[] args) {
		Scanner cin=new Scanner(System.in);
		int a,b,n,count;
		
		while(cin.hasNext())
		{			
			a=cin.nextInt();
			b=cin.nextInt();
			n=cin.nextInt();
			if(a==0&&b==0&&n==0)
				System.exit(0);
			
			BigInteger f[]=new BigInteger[2];
			f[0]=BigInteger.valueOf(1);
			f[1]=BigInteger.valueOf(1);
			count=n-2;
			for(int i=0;i<count;i++)
			{
				 BigInteger tmp = (f[0].multiply(BigInteger.valueOf(a)).add(f[1]
	                        .multiply(BigInteger.valueOf(b)))).remainder(BigInteger
	                        .valueOf(7));
	                f[1] = f[0];
	                f[0] = tmp;
			}
			System.out.println(f[0]);
		}
	}
}