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 int gcd(int a, int b) {
        return b > 0 ? gcd(b, a%b) : a;
    }

    public static class Node {
        int gcd;
        int x;
        int y;
        Node(int gcd, int x, int y) {
            this.x = x;
            this.y = y;
            this.gcd = gcd;
        }
    }

    public static class Solution {
        int x;
        int y;
        Solution(int x, int y) {
            this.x = x;
            this.y = y;
        }
    }

    public static Node extended(int a, int b) {
        if(b == 0) {
            return new Node(a, 1, 0);
        }

        Node ret = extended(b, a%b);
        int x = ret.y;
        int y = ret.x - ret.y * (int)Math.floor(a / b);
        return new Node(ret.gcd, x, y);
    }

    public static Solution findASolution(int a, int b, int c) {
        if(a == 0 && b == 0)
            return null;

        Node ret = extended(a, b);

        // If c is not divisible by gcd of a and b
        // Then no solution exist for such equation
        if(c%ret.gcd != 0) {
            return null;
        }

        int x = ret.x * (c / ret.gcd);
        int y = ret.y * (c / ret.gcd);
        if(a < 0) x = -1*x;
        if(b < 0) y = -1*y;
        return new Solution(x, y);
    }

    public static boolean havePositiveSolution(int a, int b, int c) {
        Solution s = findASolution(a,b,c);
        if(s == null)
            return false;
        int g  = gcd(a, b);
        if(s.x >= 0 && s.y >= 0) return true;
        else if(s.x < 0 && s.y < 0) return false;
        else {
            if(s.x < 0) {
                int cnt = -s.x*g % b > 0 ? (-s.x*g/b + 1) : -s.x*g/b;
                s.x = s.x + cnt*b/g;
                s.y = s.y - cnt*a/g;
            } else {
                int cnt = -s.y*g % a > 0 ? (-s.y*g/a + 1) : -s.y*g/a;
                s.y = s.y + cnt*a/g;
                s.x = s.x - cnt*b/g;
            }
            if(s.x >= 0 && s.y >= 0) return true;
            else return false;
        }
    }

    /************************ SOLUTION STARTS HERE ************************/
    private static void solve() {
        int a = nextInt();
        int b = nextInt();
        int c = nextInt();

        int g = gcd(a, b);
        if(c%g != 0) {
            System.out.println("No");
        } else {
            if(havePositiveSolution(a,b,c)) System.out.println("Yes");
            else System.out.println("No");
        }
    }

    /************************ SOLUTION ENDS HERE ************************/



    /************************ TEMPLATE STARTS HERE **********************/

    public static void main(String[] args) throws IOException {
        reader = new BufferedReader(new InputStreamReader(System.in));
        writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)), false);
        st = null;
        solve();
        reader.close();
        writer.close();
    }

    static BufferedReader  reader;
    static PrintWriter     writer;
    static StringTokenizer st;

    static String next() {
        while (st == null || !st.hasMoreTokens()) {
            try {
                String line = reader.readLine();
                if (line == null) {
                    return null;
                }
                st = new StringTokenizer(line);
            } catch (Exception e) {
                throw new RuntimeException();
            }
        }
        return st.nextToken();
    }

    static String nextLine() {
        String s = null;
        try {
            s = reader.readLine();
        } catch (IOException e) {
            e.printStackTrace();
        }
        return s;
    }

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

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

    static double nextDouble() {
        return Double.parseDouble(next());
    }

    static char nextChar() {
        return next().charAt(0);
    }

    static int[] nextIntArray(int n) {
        int[] a = new int[n];
        int i = 0;
        while (i < n) {
            a[i++] = nextInt();
        }
        return a;
    }

    static long[] nextLongArray(int n) {
        long[] a = new long[n];
        int i = 0;
        while (i < n) {
            a[i++] = nextLong();
        }
        return a;
    }

    static int[] nextIntArrayOneBased(int n) {
        int[] a = new int[n + 1];
        int i = 1;
        while (i <= n) {
            a[i++] = nextInt();
        }
        return a;
    }

    static long[] nextLongArrayOneBased(int n) {
        long[] a = new long[n + 1];
        int i = 1;
        while (i <= n) {
            a[i++] = nextLong();
        }
        return a;
    }

    static void print(Object o) {
        writer.print(o);
    }

    static void println(Object o) {
        writer.println(o);
    }

    static void printArr(int[] arr) {
        for(int i = 0 ; i < arr.length; i++)
            System.out.print(arr[i] + " ");
        System.out.println();
    }

    /************************ TEMPLATE ENDS HERE ************************/
}