Problem: Dante is engaged in a fight with "The Savior". Before he can fight it with his sword, he needs to break its shields. He has two guns, Ebony and Ivory, each of them is able to perform any non-negative number of shots.

For every bullet that hits the shield, Ebony deals a units of damage while Ivory deals b units of damage. In order to break the shield Dante has to deal exactly c units of damage. Find out if this is possible.

Input

The first line of the input contains three integers a, b, c (1 ≤ a, b ≤ 100, 1 ≤ c ≤ 10 000) — the number of units of damage dealt by Ebony gun and Ivory gun, and the total number of damage required to break the shield, respectively.

Output

Print "Yes" (without quotes) if Dante can deal exactly c damage to the shield and "No" (without quotes) otherwise.

Examples

Input

4 6 15


Output

No


Input

3 2 7


Output

Yes


Input

6 11 6


Output

Yes

Note

In the second sample, Dante can fire 1 bullet from Ebony and 2 from Ivory to deal exactly 1·3 + 2·2 = 7 damage. In the third sample, Dante can fire 1 bullet from ebony and no bullets from ivory to do 1·6 + 0·11 = 6 damage. 

Solution (in JAVA):

Solution:
import java.io.*;
import java.util.*;

public class Main {
	public static void main(String[] args) {
		FastScanner fs = new FastScanner();
		PrintWriter out = new PrintWriter(System.out);
		// int t = fs.nextInt();
		for (int k = 1; k <= 1; k++) {
			// int n = fs.nextInt();
			// long k = fs.nextLong();
			// Long arr[] = fs.readLongArray(n);
			int a = fs.nextInt();
			int b = fs.nextInt();
			int c = fs.nextInt();
			int arr[] = { 0, 0 };

			int g = gcdCoeff(a, b, arr);
			// out.println(arr[0] + " " + arr[1]+" "+g);

			if (c % g != 0) {
				out.println("No");
			} else {
				int s = c;
				boolean check = false;
				while (s >= 0) {
					if (s % b == 0) {
						check = true;
						break;
					}
					s -= a;
				}
				if (check) {
					out.println("Yes");
				} else {
					out.println("No");
				}
			}

		}

		out.close();
	}

	public static Long solver(Long arr[], int n) {
		Long min = Long.MAX_VALUE;
		Long working = arr[0];
		Long operations = 0L;
		boolean dec = false;
		Long max = Long.MIN_VALUE;
		for (int i = 0; i < n; i++) {
			max = Math.max(max, arr[i]);
			if (arr[i] < max) {
				// System.out.println("max "+max+" "+arr[i]);
				dec = true;
			}
		}
		for (int i = 1; i <= n; i++) {
			if (i < n - 1 && arr[i] <= arr[i + 1] && !dec) {

				// System.out.println(arr[i]+" "+arr[i+1]);
				continue;
			}
			if (i < n - 1 && arr[i] <= arr[i + 1]) {
				working = arr[i + 1];
			}
			Long h = (i == n) ? Long.MAX_VALUE : arr[i];

			min = Math.min(min, h);
			if (h >= working && h != Long.MAX_VALUE) {
				System.out.println(working + " " + min + " " + operations);
				operations += working - min;
				System.out.println(operations);
				working = h;
				min = Long.MAX_VALUE;

			}
		}

		/*
		 * Stack<Long> stack=new Stack<>(); stack.push(arr[0]); Long operations=0L;
		 * boolean dec=false; for(int i=1;i<=n;i++){
		 * if(!stack.isEmpty()&&i<n&&arr[i]<stack.peek()){ dec=true; } Long
		 * h=(i==n)?Long.MAX_VALUE:arr[i]; while(stack.size()>1&&dec&&stack.peek()<h){
		 * operations++; Long element=stack.pop(); element++;
		 * if(element!=stack.peek()&&element!=h){ stack.push(element); } }
		 * if(stack.peek()>h){ stack.push(h); } else
		 * if(stack.peek()<h&&h!=Long.MAX_VALUE){ stack.pop(); stack.push(h); } }
		 */
		return operations;
	}

	public static int gcd(int a, int b) {
		if (a == 0)
			return b;

		return gcd(b % a, a);
	}

	static int gcdCoeff(int a, int b, int arr[])// euclidean gcd + extended euclidean
	{
		if (b == 0)
			return a;
		int tmp[] = { 1, 1 };// must be 1,1, because at base step b=0, a=anything, 1.0+ 1.a=a
		int result = gcdCoeff(b, a % b, tmp);
		arr[0] = tmp[1];// x=y1
		arr[1] = (tmp[0] - (a / b) * tmp[1]);// y=(x1-(a/b)*y1)
		return result;
	}

	static class PairIndex {
		long val;
		long index;

		public PairIndex(long val, long index) {
			this.val = val;
			this.index = index;
		}

	}

	static class FastScanner {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st = new StringTokenizer("");

		String next() {
			while (!st.hasMoreTokens())
				try {
					st = new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				}
			return st.nextToken();
		}

		int nextInt() {
			return Integer.parseInt(next());
		}

		int[] readIntArray(int n) {
			int[] a = new int[n];
			for (int i = 0; i < n; i++)
				a[i] = nextInt();
			return a;
		}

		Long[] readLongArray(int n) {
			Long[] a = new Long[n];
			for (int i = 0; i < n; i++)
				a[i] = nextLong();
			return a;
		}

		long nextLong() {
			return Long.parseLong(next());
		}
	}
}