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.

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.

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

NoteIn 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.

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.math.BigInteger;
import java.util.*;
public class Likes {
    static class FastReader {
        BufferedReader br;
        StringTokenizer st;

        public FastReader() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreTokens()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    // TODO Auto-generated catch block
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                // TODO Auto-generated catch block
                e.printStackTrace();
            }
            return str;
        }

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

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

        long nextLong() {

            return Long.parseLong(next());
        }

        BigInteger nextBigIntger() {
            BigInteger bb = new BigInteger(next());
            return bb;
        }
    }
    public static void main(String[] args) {
        FastReader sc = new FastReader();
        int a  =sc.nextInt(),b  =sc.nextInt(),c = sc.nextInt();
        int ind=0;
        for(int i=c;i>=0;i-=b){
            if(i==0||i%a==0){
                ind =1;
                break;
            }
        }
        System.out.println(ind==0?"NO":"YES");

    }
}

import java.io.*;
import java.util.*;

public class NumbersColoring {
	public static void main(String[] args) throws IOException {
		InputReader reader = new InputReader();
		int a = reader.nextInt(), b = reader.nextInt(), c = reader.nextInt(), i = 0;
		boolean check = false;
		while (a * i <= c) {
			if ((c - (a*i)) % b == 0) {
				check = true;
				break;
			}
			i++;
		}
		System.out.print(check ? "Yes" : "No");
	}

	public static long gcd(long a, long b) {
		return b == 0 ? Math.abs(a) : gcd(b, a % b);
	}

	static class InputReader {

		InputStream is = System.in;
		byte[] inbuf = new byte[1 << 25];
		int lenbuf = 0, ptrbuf = 0;

		public InputReader() throws IOException {
			lenbuf = is.read(inbuf);
		}

		public int readByte() {

			if (ptrbuf >= lenbuf) {
				return -1;
			}

			return inbuf[ptrbuf++];
		}

		public boolean hasNext() {
			int t = skip();

			if (t == -1) {
				return false;
			}
			ptrbuf--;
			return true;
		}

		public boolean isSpaceChar(int c) {
			return !(c >= 33 && c <= 126);
		}

		public int skip() {
			int b;
			while ((b = readByte()) != -1 && isSpaceChar(b))
				;
			return b;
		}

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

		public char nextChar() {
			return (char) skip();
		}

		public String next() {
			int b = skip();
			StringBuilder sb = new StringBuilder();
			while (!(isSpaceChar(b))) {
				sb.appendCodePoint(b);
				b = readByte();
			}
			return sb.toString();
		}

		public char[] ns(int n) {
			char[] buf = new char[n];
			int b = skip(), p = 0;
			while (p < n && !(isSpaceChar(b))) {
				buf[p++] = (char) b;
				b = readByte();
			}
			return n == p ? buf : Arrays.copyOf(buf, p);
		}

		public char[][] nm(int n, int m) {
			char[][] map = new char[n][];
			for (int i = 0; i < n; i++) {
				map[i] = ns(m);
			}
			return map;
		}

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

		public int nextInt() {
			int num = 0, b;
			boolean minus = false;
			while ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))
				;
			if (b == '-') {
				minus = true;
				b = readByte();
			}

			while (true) {
				if (b >= '0' && b <= '9') {
					num = num * 10 + (b - '0');
				} else {
					return minus ? -num : num;
				}
				b = readByte();
			}
		}

		public long nextLong() {
			long num = 0;
			int b;
			boolean minus = false;
			while ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))
				;
			if (b == '-') {
				minus = true;
				b = readByte();
			}

			while (true) {
				if (b >= '0' && b <= '9') {
					num = num * 10 + (b - '0');
				} else {
					return minus ? -num : num;
				}
				b = readByte();
			}
		}

	}
}

import java.util.*;
public class InDaClub {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int a = sc.nextInt();
		int b = sc.nextInt();
		int c = sc.nextInt();
		sc.close();
		boolean f = false;
		for (int i = 0; i*a <= c && !f; i++) {
			for (int j = 0; j*b <= c; j++ ) {
				if (i*a+j*b == c) {
					f = true;
					break;
				}
			}
		}
		System.out.println(f?"Yes":"No");

	}

}

import java.io.*;
import java.util.StringTokenizer;

public class A {

    public static void main(String[] args) {
        Reader reader = new Reader(System.in);
        PrintWriter writer = new PrintWriter(System.out);

        int a = reader.readInt();
        int b = reader.readInt();
        int c = reader.readInt();
        int aa = a<b?a:b;
        int bb = a+b-aa;

        boolean result  = false;
        while(c >= 0){
            if(c % bb == 0){result = true; break;}
            c -= aa;
        }

        if(result)
            writer.println("Yes");
        else
            writer.println("No");
        writer.close();
    }

    public static class Reader{
        BufferedReader br;
        StringTokenizer st;
        public Reader(InputStream is){
            br = new BufferedReader(new InputStreamReader(is));
        }

        public String readToken(){
            if(st == null || !st.hasMoreTokens()){
                try{
                    st = new StringTokenizer(br.readLine());
                }catch(IOException e){

                }

            }
            return st.nextToken();

        }
        public String readWord(){
            return readToken();
        }
        public int readInt(){
            return Integer.parseInt(readToken());
        }
        public long readLong(){
            return Long.parseLong(readToken());
        }
    }
}

import java.util.Scanner;

public class A633 {

	static Scanner sc = new Scanner(System.in);
	static int a,b,c;
	static boolean bool;

	public static void main(String[] args) {
		a = sc.nextInt();
		b = sc.nextInt();
		c = sc.nextInt();
		eq:
		for(int i = 0;i<=c;i++) {
			for(int j = 0;j<=c;j++) {
				if(i*a+j*b==c) {
					bool = true;
					break eq;
				}

			}
		}
	System.out.println(bool?"Yes":"No");
	}
}

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class Solution {

	static InputReader in = new InputReader(System.in);

	public static void main(String[] args) {

		int a = in.nextInt();
		int b = in.nextInt();
		int c = in.nextInt();

		int x = 0;
		int y = 0;

		boolean loop = true;

		while (loop) {

			while (a * x + b * y < c) {
				y++;
			}

			if (a * x + b * y == c) {
				System.out.println("YES");
				System.exit(0);
			}

			x++;
			y = 0;

			if (a * x > c) {
				loop = !loop;
			}
		}

		System.out.println("NO");

	}
}

class InputReader {
	private BufferedReader reader;
	private StringTokenizer tokenizer;

	public InputReader(InputStream stream) {
		reader = new BufferedReader(new InputStreamReader(stream), 32768);
		tokenizer = null;
	}

	public String next() {
		while (tokenizer == null || !tokenizer.hasMoreTokens()) {
			try {
				tokenizer = new StringTokenizer(reader.readLine());
			} catch (IOException e) {
				throw new RuntimeException(e);
			}
		}
		return tokenizer.nextToken();
	}

	public String readLine() {
		try {
			return reader.readLine();
		} catch (IOException e) {
			throw new RuntimeException(e);
		}
	}

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

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

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

	public float nextFloat() {
		return Float.parseFloat(next());
	}

}

/**
 * Created by Omar on 2/26/2016.
 */

import java.util.*;
import java.io.*;

public class A {
    static boolean ans=false;
    static int counter=0;
    static boolean done=false;
    static     String[] parts;
    static int c;
    public static void main(String[] args) throws Exception {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        PrintWriter pw = new PrintWriter(System.out);
        //int n=Integer.parseInt(br.readLine());
    parts=br.readLine().split(" ");
        //int[]a= new int[n];
        //for(int i=0;i<n;i++){a[i]=Integer.parseInt(parts[i]);}
        int a =Integer.parseInt(parts[0]);
        int b =Integer.parseInt(parts[1]);
         c =Integer.parseInt(parts[2]);

        for(int i=0;i<=10000;i++){
            for(int j=0;j<=10000;j++){
                if(i*a+j*b==c)ans=true;
            }
        }
        System.out.println(ans?"Yes":"No");
        pw.close();
        br.close();
    }
//    public static void dfs(int a,int b,int c){
//        if(c==0){ans=true; return;}
//        if(c-a>=0){
//            dfs(a,b,c-a);
//        }
//        if(c-b>=0){
//            dfs(a,b,c-b);
//        }
//        else
//        return;
//    }

}

import java.util.Scanner;

public class Lololols {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner scan = new Scanner(System.in);
		int bl = scan.nextInt();
		int w = scan.nextInt();
		int ex = scan.nextInt();
		if (w > ex && bl > ex) {
			System.out.println("No");
		} else {

			if (w == ex || bl == ex || ex % bl == 0 || ex % w == 0 || w+bl==ex) {
				System.out.println("Yes");
			} else {

				boolean t = false;
//				for (int i = ex; i >= w; i = i - bl) {
//					if (i % w == 0) {
//						t = true;
//					}
//				}
				for (int i = ex; i >= bl; i = i - w) {
					if (i % bl == 0) {
						t = true;
					}
				}
				if (t) {
					System.out.println("Yes");
				} else {
					System.out.println("No");
				}
			}
		}
	}

}

import static java.lang.System.in;

import java.io.IOException;

public class AManthan {

	public static byte[] buffer = new byte[8192];
	static int offset = 0;
	static int bufferSize = 0;

	public static void main(String[] args) throws IOException {
		int a = readInt();
		int b = readInt();
		int c = readInt();
		if (c % a == 0 || c % b == 0) {
			System.out.println("Yes");
			return;
		}

		int v1 = c / a;
		int v2 = c / b;
		for (int i = 1; i <= v1; i++) {
			for (int j = 1; j <= v2; j++) {
				if (i * a + j * b == c) {
					System.out.println("Yes");
					return;
				}
			}
		}

		System.out.println("No");

	}

	static int readInt() throws IOException {
		int number = 0;
		int s = 1;
		if (offset == bufferSize) {
			offset = 0;
			bufferSize = in.read(buffer);
		}
		for (; buffer[offset] < 0x30 || buffer[offset] == '-'; ++offset) {
			if (buffer[offset] == '-')
				s = -1;
			if (offset == bufferSize - 1) {
				offset = -1;
				bufferSize = in.read(buffer);
			}
		}
		for (; offset < bufferSize && buffer[offset] > 0x2f; ++offset) {
			number = number * 0x0a + buffer[offset] - 0x30;
			if (offset == bufferSize - 1) {
				offset = -1;
				bufferSize = in.read(buffer);
			}
		}
		++offset;
		return number * s;
	}

}

import java.util.*;;
public class solve{
	public static void main(String args[]){
		Scanner in=new Scanner(System.in);
		int a=in.nextInt();
		int b=in.nextInt();
		int c=in.nextInt();
		int i=0,j=0;
		for(i=0;i<=c;i++){
			for(j=0;j<=c;j++){
				if(((a*i)+(b*j))==c)
				{System.out.println("Yes");i=c+1;break;}
			}
		}
		if(i!=c+2)
			System.out.println("No");
	}
}

import java.util.*;

public class Main {

    public static void main(String[] args) {

        Scanner sc=new Scanner(System.in);
        int a=sc.nextInt();
        int b=sc.nextInt();
        int c=sc.nextInt();
        String f="No";
        if (a>b) {a=a+b; b=a-b; a=a-b;}
        for (int i = 1; i <= c; i++) {
            if (c==a*i||(c>=a*i &&(c -a*i)%b ==0)) {
                f="Yes"; break;
            }
        }
        for (int i = 1; i <= c; i++) {
            if (c==b*i||(c>=b*i &&(c -b*i)%a ==0)) {
                f="Yes"; break;
            }
        }

        System.out.println(f);

    }

}

import java.util.*;
public class Damage {
public static void main (String[]args){
	Scanner sc = new Scanner (System.in);
	int a = sc.nextInt();
	int b = sc.nextInt();
	int c = sc.nextInt();
	boolean g = false;
	for (int n = 0 ; n<=c && g==false; n++){
		for (int m = 0; m<=c;m++)
			if (n*a+m*b==c){
				System.out.println("Yes");
				g = true;
				}}
	if (!g)System.out.println("No");
}

}

import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int a,b,c;
		a = in.nextInt();
		b = in.nextInt();
		c = in.nextInt();
		boolean flag=false;
		for(int i=0;i<=c/(float)a;i++){
			if(flag==false){
				for(int j=0;j<=c/(float)b;j++){
					if(a*i+b*j==c){
						System.out.print("Yes");
						flag = true;
						break;
					}
				}
			}else{
				break;
			}
		}
		if(flag==false){
			System.out.print("No");
		}
	}
}

// package Mathematical.Diophantine;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class TheEquation {
    public static Triplet gcd(int a,int b){
        if(a==0){
            return new Triplet(0,1,b);
        }
        Triplet prev=gcd(b%a,a);
        return new Triplet(prev.y-(b/a)*prev.x,prev.x,prev.g);
    }
    public static void main(String[] args)throws IOException {
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        String line[]=br.readLine().split(" ");
        int a=Integer.parseInt(line[0]);
        int b=Integer.parseInt(line[1]);
        int c=Integer.parseInt(line[2]);
//        line=br.readLine().split(" ");
//        int x1=Integer.parseInt(line[0]);
//        int x2=Integer.parseInt(line[1]);
//        line=br.readLine().split(" ");
//        int y1=Integer.parseInt(line[0]);
//        int y2=Integer.parseInt(line[1]);
        int x1=0,y1=0,x2=Integer.MAX_VALUE,y2=Integer.MAX_VALUE;
        Triplet start=gcd(Math.abs(a),Math.abs(b));
        if(c%start.g!=0){
            System.out.println("No");
            return;
        }
        long x0=start.x*(c/start.g);
        long y0=start.y*(c/start.g);
        if(a<0){
            x0=-x0;
        }
        if(b<0){
            y0=-y0;
        }
//        System.out.println(x0+" "+y0);
        double k;
        int g=start.g;
        long xl1,xl2,xr1,xr2;
        k=(double)(x1-x0)/(b/g);
        if((x1-x0)%(b/g)==0){
            xl1=x1;
        }
        else{
            if(b/g>0){
                long knew=(long)Math.floor(k)+1;
//                System.out.println(k+" "+knew);
                xl1=x0+knew*(b/g);
//                System.out.println(xl1);
            }
            else{
                long knew=(long)Math.floor(k);
                xl1=x0+knew*(b/g);
            }
        }
        k=(double)(x2-x0)/(b/g);
        if((x2-x0)%(b/g)==0){
            xl2=x2;
        }
        else{
            if(b/g>0){
                long knew=(long)Math.floor(k);
                xl2=x0+knew*(b/g);
            }
            else{
                long knew=(long)Math.floor(k)+1;
                xl2=x0+knew*(b/g);
            }
        }
//        System.out.println(x0+" "+y0);
//        System.out.println(xl1+" "+xl2);
        k=(double)(y0-y1)/(a/g);
        if((y0-y1)%(a/g)==0){
            xr1=x0+(long)k*(b/g);
        }
        else{
            if(a/g>0){
                long knew=(long)Math.floor(k);
                xr1=x0+knew*(b/g);
            }
            else{
                long knew=(long)Math.floor(k)+1;
                xr1=x0+knew*(b/g);
            }
        }
        k=(double)(y0-y2)/(a/g);
        if((y0-y2)%(a/g)==0){
            xr2=x0+(long)k*(b/g);
        }
        else{
            if(a/g>0){
                long knew=(long)Math.floor(k)+1;
//                System.out.println(k+" "+knew);
//                System.out.println(y0-k*(a/g));
                xr2=x0+knew*(b/g);
            }
            else{
                long knew=(long)Math.floor(k);
                xr2=x0+knew*(b/g);
            }
        }
//        System.out.println(xr1+" "+xr2);
        if(xl1>xl2){
            long temp=xl1;
            xl1=xl2;
            xl2=temp;
        }
        if(xr1>xr2){
            long temp=xr1;
            xr1=xr2;
            xr2=temp;
        }
        long xl=Math.max(xl1,xr1);
        long xr=Math.min(xl2,xr2);
//        System.out.println(xl1+" "+xl2);
//        System.out.println(xr1+" "+xr2);
//        System.out.println(xl+" "+xr);
        if(xr>=xl&&xr>=0){
            System.out.println("Yes");
        }
        else{
            System.out.println("No");
        }
//        System.out.println((xr-xl)/(b/g)+1);
    }
}
class Triplet{
    int x,y,g;
    public Triplet(int x,int y,int g){
        this.x=x;
        this.y=y;
        this.g=g;
    }
}

import java.io.*;
import java.util.InputMismatchException;

public class Main2 {
    public static void main(String[] xps){
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        StringBuilder sb = new StringBuilder();

            int a = in.Int();
            int b = in.Int();
            int c = in.Int();

        boolean isPossible = false;

        for (int i = 0; i <= 10000; i++) {
            if (isPossible)
                break;
            for (int j = 0; j <= 10000; j++) {
                if (a*i + b*j == c){
                    isPossible = true;
                    break;
                }
            }
        }
        out.println(isPossible ? "Yes" : "No");
        out.close();
    }

    private static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;
        private SpaceCharFilter filter;

        public InputReader(InputStream stream) {
            this.stream = stream;
        }

        public int read() {
            if (numChars == -1) {
                throw new InputMismatchException();
            }
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
                if (numChars <= 0) {
                    return -1;
                }
            }
            return buf[curChar++];
        }

        public int Int() {
            int c = read();
            while (isSpaceChar(c)) {
                c = read();
            }
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            int res = 0;
            do {
                if (c < '0' || c > '9') {
                    throw new InputMismatchException();
                }
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public String String() {
            int c = read();
            while (isSpaceChar(c)) {
                c = read();
            }
            StringBuilder res = new StringBuilder();
            do {
                res.appendCodePoint(c);
                c = read();
            } while (!isSpaceChar(c));
            return res.toString();
        }

        public double Double() {
            int c = read();
            while (isSpaceChar(c)) {
                c = read();
            }
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            double res = 0;
            while (!isSpaceChar(c) && c != '.') {
                if (c == 'e' || c == 'E') {
                    return res * Math.pow(10, Int());
                }
                if (c < '0' || c > '9') {
                    throw new InputMismatchException();
                }
                res *= 10;
                res += c - '0';
                c = read();
            }
            if (c == '.') {
                c = read();
                double m = 1;
                while (!isSpaceChar(c)) {
                    if (c == 'e' || c == 'E') {
                        return res * Math.pow(10, Int());
                    }
                    if (c < '0' || c > '9') {
                        throw new InputMismatchException();
                    }
                    m /= 10;
                    res += (c - '0') * m;
                    c = read();
                }
            }
            return res * sgn;
        }

        public long Long() {
            int c = read();
            while (isSpaceChar(c)) {
                c = read();
            }
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            long res = 0;
            do {
                if (c < '0' || c > '9') {
                    throw new InputMismatchException();
                }
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public boolean isSpaceChar(int c) {
            if (filter != null) {
                return filter.isSpaceChar(c);
            }
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        public String next() {
            return String();
        }

        public interface SpaceCharFilter {
            public boolean isSpaceChar(int ch);
        }
    }
}

class Diophantine {
    public int[] gcd(int p, int q) {
        if (q == 0)
            return new int[] {p, 1, 0};

        int[] values = gcd(q, p % q);
        int d = values[0];
        int a = values[2];
        int b = values[1] - (p / q) * values[2];

        return new int[]{d, a, b};
    }

    public int[] findAnySolution(int a, int b, int c) {
        int[] values = gcd(Math.abs(a), Math.abs(b));
        int g = values[0];
        int x0 = values[1];
        int y0 = values[2];

        if (c % g != 0) {
            return new int[]{};
        }

        x0 *= c / g;
        y0 *= c / g;

        if (a < 0)
            x0 = -x0;
        if (b < 0)
            y0 = -y0;

        return new int[]{ x0, y0 , g};
    }
}

import java.io.*;
import java.util.Scanner;
public class Main {
public static void main(String args[])throws IOException
{
	Scanner s1=new Scanner(System.in);
	int a=Integer.parseInt(s1.next());
	int b=Integer.parseInt(s1.next());
	int c=Integer.parseInt(s1.next());
	int flag=0;
	for(long i=0;i<=10000;i++)
	{
		for(long j=0;j<=10000;j++)
		{
			if((a*i)+(b*j)==c)
			{
				flag=1;
				break;
			}

		}
		if(flag==1)
			break;
	}
	if(flag==1)
		System.out.println("Yes");
	else
		System.out.println("No");
}
}

import java.io.*;
import java.util.*;

public class Main
{
    public static void main(String[] args) throws IOException
	{
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
            StringTokenizer st = new StringTokenizer(br.readLine());

            int a = Integer.parseInt(st.nextToken());
            int b = Integer.parseInt(st.nextToken());
            int c = Integer.parseInt(st.nextToken());

            if(c %gcd(a,b) == 0 && (a <= c || b <= c))
            {
                int x = 0, tmp = 1;
                while(tmp > 0)
                {
                    tmp = (c - x*a) %b;
                    x++;
                }
                System.out.println(c - (x-1)*a >= 0? "Yes": "No");
            }
            else System.out.print("No");
      }

      static long gcd(long a, long b) {
            return a == 0? b: gcd(b % a, a);
      }
}

//package Contest;

import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;

/**
 * Problem: Ebony and Ivory
 * problem Link: http://codeforces.com/contest/633/problem/A
 *
 * @author: Ashok Rajpurohit (ashok1113@gmail.com)
 */

public class C633A {

    private static PrintWriter out;
    private static InputStream in;

    public static void main(String[] args) throws IOException {
        OutputStream outputStream = System.out;
        in = System.in;
        out = new PrintWriter(outputStream);
        C633A a = new C633A();
        a.solve();
        out.close();
    }

    public void solve() throws IOException {
        InputReader in = new InputReader();
        int a = in.readInt(), b = in.readInt(), c = in.readInt();
        if (process(a, b, c))
            out.println("Yes");
        else
            out.println("No");
    }

    private static boolean process(int a, int b, int c) {
        int g = gcd(a, b);
        if (c % g != 0)
            return false;

        int r = 0, s = c;
        while (r <= c && s >= 0) {
            if (s % b == 0)
                return true;

            r += a;
            s -= a;
        }

        return false;
    }

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

        return gcd(b, a % b);
    }

    final static class InputReader {
        byte[] buffer = new byte[8192];
        int offset = 0;
        int bufferSize = 0;

        public int readInt() throws IOException {
            int number = 0;
            int s = 1;
            if (offset == bufferSize) {
                offset = 0;
                bufferSize = in.read(buffer);
            }
            if (bufferSize == -1)
                throw new IOException("No new bytes");
            for (; buffer[offset] < 0x30 || buffer[offset] == '-'; ++offset) {
                if (buffer[offset] == '-')
                    s = -1;
                if (offset == bufferSize - 1) {
                    offset = -1;
                    bufferSize = in.read(buffer);
                }
            }
            for (; offset < bufferSize && buffer[offset] > 0x2f; ++offset) {
                number = (number << 3) + (number << 1) + buffer[offset] - 0x30;
                if (offset == bufferSize - 1) {
                    offset = -1;
                    bufferSize = in.read(buffer);
                }
            }
            ++offset;
            return number * s;
        }

        public int[] readIntArray(int n) throws IOException {
            int[] ar = new int[n];
            for (int i = 0; i < n; i++)
                ar[i] = readInt();

            return ar;
        }

        public long readLong() throws IOException {
            long res = 0;
            int s = 1;
            if (offset == bufferSize) {
                offset = 0;
                bufferSize = in.read(buffer);
            }
            for (; buffer[offset] < 0x30 || buffer[offset] == '-'; ++offset) {
                if (buffer[offset] == '-')
                    s = -1;
                if (offset == bufferSize - 1) {
                    offset = -1;
                    bufferSize = in.read(buffer);
                }
            }
            for (; offset < bufferSize && buffer[offset] > 0x2f; ++offset) {
                res = (res << 3) + (res << 1) + buffer[offset] - 0x30;
                if (offset == bufferSize - 1) {
                    offset = -1;
                    bufferSize = in.read(buffer);
                }
            }
            ++offset;
            if (s == -1)
                res = -res;
            return res;
        }

        public long[] readLongArray(int n) throws IOException {
            long[] ar = new long[n];

            for (int i = 0; i < n; i++)
                ar[i] = readLong();

            return ar;
        }

        public String read() throws IOException {
            StringBuilder sb = new StringBuilder();
            if (offset == bufferSize) {
                offset = 0;
                bufferSize = in.read(buffer);
            }

            if (bufferSize == -1 || bufferSize == 0)
                throw new IOException("No new bytes");

            for (;
                 buffer[offset] == ' ' || buffer[offset] == '\t' || buffer[offset] ==
                 '\n' || buffer[offset] == '\r'; ++offset) {
                if (offset == bufferSize - 1) {
                    offset = -1;
                    bufferSize = in.read(buffer);
                }
            }
            for (; offset < bufferSize; ++offset) {
                if (buffer[offset] == ' ' || buffer[offset] == '\t' ||
                    buffer[offset] == '\n' || buffer[offset] == '\r')
                    break;
                if (Character.isValidCodePoint(buffer[offset])) {
                    sb.appendCodePoint(buffer[offset]);
                }
                if (offset == bufferSize - 1) {
                    offset = -1;
                    bufferSize = in.read(buffer);
                }
            }
            return sb.toString();
        }

        public String read(int n) throws IOException {
            StringBuilder sb = new StringBuilder(n);
            if (offset == bufferSize) {
                offset = 0;
                bufferSize = in.read(buffer);
            }

            if (bufferSize == -1 || bufferSize == 0)
                throw new IOException("No new bytes");

            for (;
                 buffer[offset] == ' ' || buffer[offset] == '\t' || buffer[offset] ==
                 '\n' || buffer[offset] == '\r'; ++offset) {
                if (offset == bufferSize - 1) {
                    offset = -1;
                    bufferSize = in.read(buffer);
                }
            }
            for (int i = 0; offset < bufferSize && i < n; ++offset) {
                if (buffer[offset] == ' ' || buffer[offset] == '\t' ||
                    buffer[offset] == '\n' || buffer[offset] == '\r')
                    break;
                if (Character.isValidCodePoint(buffer[offset])) {
                    sb.appendCodePoint(buffer[offset]);
                }
                if (offset == bufferSize - 1) {
                    offset = -1;
                    bufferSize = in.read(buffer);
                }
            }
            return sb.toString();
        }
    }
}

import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class A {

	public static void main(String[] args) {

		Scanner scanner = new Scanner(System.in);

		int a = scanner.nextInt();
		int b = scanner.nextInt();
		int c = scanner.nextInt();

		List<Integer> sums = new ArrayList<Integer>();

		int sumA = 0;
		int sumB = 0;

		while(sumA <= c) {
			sums.add(sumA);
			sumA += a;

		}

		while(sumB <= c) {
			sums.add(sumB);
			sumB += b;

		}

		for(int i = 0; i < sums.size(); i++) {
			for(int j = 0; j < sums.size(); j++) {

				if(sums.get(i) + sums.get(j) == c) {
					System.out.println("Yes");
					return;
				}

			}

		}

		System.out.println("No");

	}

}

import java.util.Scanner;

public class CManthanA {

	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int a = scan.nextInt();
		int b = scan.nextInt();
		int c = scan.nextInt();

		int i=0;
		while (i*a <= c) {
			if ((c-i*a)%b==0) {
				System.out.println("Yes");
				return;
			}
			i++;
		}

		System.out.println("No");
	}

}

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class A {

	public static void main(String[] args) throws Exception {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st = new StringTokenizer(br.readLine());
		int a = Integer.parseInt(st.nextToken());
		int b = Integer.parseInt(st.nextToken());
		int c = Integer.parseInt(st.nextToken());
		boolean ret = false;
		for (int i = 0; i < 10_001; i++) {
			if ((c - i * a) >= 0 && (c - i * a) % b == 0) {
				ret = true;
				break;
			}
		}
		System.out.println(ret ? "Yes" : "No");
	}
}

import java.util.*;

public class ebony_and_ivory
{
    public static void main( String[] args )
    {
        Scanner in = new Scanner( System.in );
        int a = in.nextInt(), b = in.nextInt(), c = in.nextInt();
        boolean[] dp = new boolean[10001];
        dp[0] = true;
        for ( int i = 1; i < 10001; i++ )
        {
            if ( i >= a )
                dp[i] = dp[i] || dp[i - a];
            if ( i >= b )
                dp[i] = dp[i] || dp[i - b];
        }
        if ( dp[c] == true )
            System.out.println( "Yes" );
        else
            System.out.println( "No" );
        in.close();
        System.exit( 0 );
    }
}

import java.util.Scanner;

// AhmadBarhamje
public class A {
	public static void main(String[] args) {
		Scanner s = new Scanner(System.in);
		int a = s.nextInt(), b = s.nextInt(), c = s.nextInt();
		int n = 0;
		while(c >= n*a) {
			if((c-n*a)%b==0) {
				System.out.println("Yes");
				return;
			}
			n++;
		}
		System.out.println("No");
	}
}

import java.util.Scanner;

public class EbonyandEvory {

	public static void main(String[] args) {
		// TODO Auto-generated method stub

		Scanner input = new Scanner(System.in);
		int a = input.nextInt();
		int b = input.nextInt();
		int c = input.nextInt();
		for(int i=0; (c-i*a)>=0;i++){
			if((c-i*a)%b==0){
				System.out.println("Yes");
				return;
			}
		}
		System.out.println("No");
	}

	private static int gcd(int a, int b){
		if(b==0)return a;
		else
			return gcd(b,a%b);

	}

}

import java.util.Arrays;
import java.util.Scanner;
public class Main {

	static int o=1;
	public static void main(String[] args) {

		Scanner in = new Scanner(System.in);

	   int a = in.nextInt();
	   int b = in.nextInt();
	   int c = in.nextInt();

	   int min = Math.min(a, b);
	   int max = Math.max(a, b);

	   if(c % a == 0 || c % b == 0){
		   System.out.println("YES");
		   System.exit(0);
	   }

	   else {

	      for(int i=1 ; i<=10000 ; i++){
		       int r = a + b * i;
		       if(r == c){
		    	   System.out.println("YES");
		    	   System.exit(0);
		       }
	      } //end for

	      for(int i=1 ; i<=10000 ; i++){

	    	  int r = a * i + b;
	    	  if(r == c){
		    	   System.out.println("YES");
		    	   System.exit(0);
		       }
	      }//end for

	      int l=1;
         for(int i=1 ; i<=10000 ; i++){

	    	  int r = min * i + max * l;
	    	  if(r == c){
		    	   System.out.println("YES");
		    	   System.exit(0);
		       }
	    	  else if(i == 10000){
	    		  i=1;
	    		  l = increase();
	    		  if(l == 10001)
	    			  break;
	    	  }
	      }//end for

	   } //end else

	   System.out.println("NO");

	}

	public static int increase(){

		o++;

	    return o;
	}
}

import java.util.Scanner;

public class EbonyandIvory {
    public static void main(String args[]){
        Scanner sc = new Scanner(System.in);
        int a=sc.nextInt();
        int b=sc.nextInt();
        int c=sc.nextInt();
        int A,B;

        if((c%a==0)||(c%b==0)){
            System.out.println("YES");
        }else{
            A=Integer.max(a,b);
            B=Integer.min(a,b);

            while (c>0){
                c-=A;
                if(c%B==0) break;
            }
            System.out.println(c>0?"YES":"NO");
        }
    }
}

import java.awt.geom.AffineTransform;
import java.awt.geom.Point2D;
import java.io.*;
import java.util.*;

public class ManthanA
{

private static StringTokenizer st;

    public static void nextLine(BufferedReader br) throws IOException
    {
        st = new StringTokenizer(br.readLine());
    }

    public static int nextInt()
    {
        return Integer.parseInt(st.nextToken());
    }

    public static String next()
    {
        return st.nextToken();
    }

    public static long nextLong()
    {
        return Long.parseLong(st.nextToken());
    }

    public static double nextDouble()
    {
        return Double.parseDouble(st.nextToken());
    }

    public static void main(String[] args) throws IOException
    {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        nextLine(br);
        int a = nextInt();
        int b = nextInt();
        int c = nextInt();
        boolean good = false;
        for (int i = 0; i <= 10000; i++)
        {
            int sc = (c - i * a);
            if (sc >= 0 && sc % b == 0)
            {
                good = true;
            }
        }
        if (good)
        {
            System.out.println("Yes");
        }
        else
        {
            System.out.println("No");
        }
    }

}

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class contest {

	public static void main(String[] args)throws NumberFormatException,IOException {
	          BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
	          StringTokenizer st = new StringTokenizer(bf.readLine());
	          int a = Integer.parseInt(st.nextToken());
	          int b = Integer.parseInt(st.nextToken());
	          int c = Integer.parseInt(st.nextToken());
	          int at = c / a;
	          int bt = c / b;
	          boolean is = false;
	      //  System.out.println(at);
	        // System.out.println(bt);
	          for (int i = 0; i <= at ; i++) {
				 for (int j = 0; j <= bt; j++) {
					if( (a*i)+(b*j) == c){
						//System.out.println((a*i)+(b*j));
						System.out.println("Yes");
						is = true;
						break;
			}

			}
				 if(is){

					    //	System.out.println("ffff");
					    	break;
					    }
	          }
	          if(!is)
	        	  System.out.println("No");

	}

}

	import java.util.Scanner;

	public class Guns {

		public static void main(String[] args) {

			int contador=0;

			Scanner x=new Scanner(System.in);
			int[] entrada={x.nextInt(),x.nextInt(),x.nextInt()};

			for(int i=0; i<=entrada[2];i++){

				for(int j=0; j<=entrada[2];j++){

					int num1=i*entrada[0]+j*entrada[1];
					int num2=i*entrada[1]+j*entrada[0];
					if(num1==entrada[2]){
						contador++;
					}

				}

			}

			if(contador>=1){
				System.out.print("Yes");
			}
			else{
				System.out.print("No");
			}

		}

	}

import java.util.*;
import java.io.*;
import java.lang.*;

public class A633 {

  public static void main(String[] args) {

    int gun1, gun2, needed;
    boolean possible = false;

    Scanner s = new Scanner(System.in);
    gun1 = s.nextInt();
    gun2 = s.nextInt();
    needed = s.nextInt();

    if(needed % gun2 == 0) possible = true;
    for(int i=0; i<gun2 && !possible && needed >=gun1; i++){
      needed -= gun1;
      if(needed % gun2 == 0) possible = true;
    }

    if (possible)
      System.out.println("YES");
    else
      System.out.println("NO");
  }
}

import java.util.Scanner;

public class EbonyAndIvory{

	public static void main(String[] args){

		Scanner kbd = new Scanner(System.in);

		int ebony = kbd.nextInt();
		int ivory = kbd.nextInt();
		int totalDamage = kbd.nextInt();

		int damageE;
		int damageI;
		boolean defeat = false;

		Outer:
		for(int x=0; x <= totalDamage; x++){
			damageE = ebony*x;
			if(damageE == totalDamage){
				System.out.print("Yes");
				defeat = true;
				break Outer;
			}
			for(int y=0; y <= totalDamage; y++){
				damageI = ivory*y;
				if(damageE + damageI == totalDamage){
					System.out.print("Yes");
					defeat = true;
					break Outer;
				}
			}
		}
		if(defeat == false)
			System.out.print("No");
	}
}

import java.util.Scanner;

public class Lololols {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner scan = new Scanner(System.in);
		int bl = scan.nextInt();
		int w = scan.nextInt();
		int ex = scan.nextInt();
		if (w > ex && bl > ex) {
			System.out.println("No");
		} else {

			if (w == ex || bl == ex || ex % bl == 0 || ex % w == 0 || w+bl==ex) {
				System.out.println("Yes");
			} else {

				boolean t = false;
//				for (int i = ex; i >= w; i = i - bl) {
//					if (i % w == 0) {
//						t = true;
//					}
//				}
				for (int i = ex; i >= bl; i = i - w) {
					if (i % bl == 0) {
						t = true;
					}
				}
				if (t) {
					System.out.println("Yes");
				} else {
					System.out.println("No");
				}
			}
		}
	}

}

import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

public final class Main
{
	static long mod = 998244353l;
	static Map<Long, Long> invk = new HashMap<>();
	static int f[];
	static int fmin = 0;

	public static void main(String[] args) throws IOException
	{
		Scanner in = getScan(args);
		// int tt = in.nextInt();
		// while (tt-- > 0)
		// {
		int a = in.nextInt();
		int b = in.nextInt();
		int c = in.nextInt();
		Pair p = new Pair();
		long gcd = gcd(a, b, p);
		if (c % gcd == 0)
		{
			int q = c / (int) gcd;
			double x1 = (double) (p.first * q) / (b / gcd);
			double x2 = (double) (-p.second * q) / (a / gcd);
			if (Math.ceil(Math.min(x1, x2)) <= Math.max(x1, x2)) System.out.println("YES");
			else System.out.println("NO");
		}
		else
		{
			System.out.println("NO");
		}
		// }
	}

	public static long gcd(long a, long b, Pair p)
	{
		long x = 1, y = 0, x1 = 0, y1 = 1, a1 = a, b1 = b;

		while (b1 > 0)
		{
			long q = a1 / b1;
			long tmp = x - q * x1;
			x = x1;
			x1 = tmp;
			tmp = y - q * y1;
			y = y1;
			y1 = tmp;
			tmp = a1 - q * b1;
			a1 = b1;
			b1 = tmp;
		}
		p.first = x;
		p.second = y;
		return a1;
	}

	public static class Pair
	{
		public long first;
		public long second;
	}

	public static long gcd(long a, long b)
	{
		if (a == 0 || b == 0)
		{
			return a | b;
		}
		int shift = Long.numberOfTrailingZeros(a | b);
		a = a >> Long.numberOfTrailingZeros(a);
		while (b > 0)
		{
			b = b >> Long.numberOfTrailingZeros(b);
			if (a > b)
			{
				long tmp = a;
				a = b;
				b = tmp;
			}
			b -= a;
		}
		return a << shift;
	}

	public static int find(Subset[] subset, int i)
	{
		if (subset[i].parent != i)
		{
			subset[i].parent = find(subset, subset[i].parent);
		}
		return subset[i].parent;
	}

	public static void union(Subset[] subset, int x, int y)
	{
		int rootx = find(subset, x);
		int rooty = find(subset, y);
		if (subset[rootx].rank < subset[rooty].rank)
		{
			subset[rootx].parent = rooty;
		}
		else if (subset[rootx].rank > subset[rooty].rank)
		{
			subset[rooty].parent = rootx;
		}
		else
		{
			subset[rootx].parent = rooty;
			subset[rooty].rank++;
		}
	}

	static class Subset
	{
		int parent;
		int rank;
	}

	public static long fact(int n)
	{
		if (n <= fmin)
		{
			return f[n];
		}
		long res = f[fmin];
		for (int i = fmin + 1; i <= n; i++)
		{
			res = (res * i) % mod;
			f[i] = (int) res;
		}
		fmin = n;
		return res;
	}

	public static int log2nlz(int bits)
	{
		if (bits == 0) return 0; // or throw exception
		return 31 - Integer.numberOfLeadingZeros(bits);
	}

	static Scanner getScan(String[] args) throws IOException
	{
		if (args.length == 0)
		{
			return new Scanner(System.in);
		}
		else
		{
			return new Scanner(new File(args[0]));
		}
	}

	static BufferedReader getBuffer(String[] args) throws IOException
	{
		if (args.length == 0)
		{
			return new BufferedReader(new InputStreamReader(System.in));
		}
		else
		{
			return new BufferedReader(new FileReader(args[0]));
		}
	}

	public static long binpowMod(long x, long y, long mod)
	{
		long z = 1;
		x = x % mod;
		while (y > 0)
		{
			if (y % 2 == 1)
			{
				z = (z * x) % mod;
				y--;
			}
			else
			{
				x = (x * x) % mod;
				y = y >> 1;
			}
		}
		return z;
	}

	public static long invMod(long x, long mod)
	{
		if (!invk.containsKey(x))
		{
			invk.put(x, binpowMod(x, mod - 2, mod));
		}
		return invk.get(x);
	}

	public static long divMod(long x, long y, long mod)
	{
		x = x % mod;
		y = y % mod;
		return (x * invMod(y, mod)) % mod;
	}
}

/* package codechef; // don't place package name! */

import java.util.*;
import java.lang.*;
import java.io.*;

/* Name of the class has to be "Main" only if the class is public. */
public class Main
{
   static boolean solution(int a, int b, int n)
	{
		for (int i = 0; i * a <= n; i++)
		{
			if ((n - (i * a)) % b == 0)
			{

				return true;
			}
		}

		return false;
	}

  public static void main (String[] args) throws java.lang.Exception
   {
	try{
	    Scanner sc=new Scanner(System.in);
		   int a=sc.nextInt();
		      int b=sc.nextInt();
		      int c=sc.nextInt();
		     if(solution(a,b,c))
		       System.out.println("Yes");
		    else
		     System.out.println("No");

	   }
	catch(Exception e)
		 {}
	}
}

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.math.BigInteger;
import java.util.ArrayDeque;
import java.util.Queue;
import java.util.StringTokenizer;

public class A {

	private static BufferedReader br;
	private static StringTokenizer st;

	public static void main(String[] args) throws IOException {
		br = new BufferedReader(new InputStreamReader(System.in));
		line();
		int a = nextInt();
		int b = nextInt();
		int total = nextInt();

//		if (total % a == 0 || total % b == 0) {
//			System.out.println("Yes");
//			return;
//		}
//		boolean[] values = new boolean[total + 2];
//		Queue<Integer> q = new ArrayDeque<Integer>();
//		int min = Math.min(a, b);
//		int max = Math.max(a, b);
//		q.add(min);
//		q.add(max);
//		values[min] = true;
//		values[max] = true;
//		while (!q.isEmpty()) {
//			Integer cur = q.poll();
//			int i = cur + min;
//			int j = cur + max;
//			if (i < values.length && !values[i]) {
//				values[i] = true;
//				q.add(i);
//			}
//			if (j < values.length && !values[j]) {
//				values[j] = true;
//				q.add(j);
//			}
//		}
//
//		System.out.println(values[total] ? "Yes" : "No");

		for (int i = 0; i < 10000; i++) {
			for (int j = 0; j < 10000; j++) {
				if (i*a + j*b == total) {
					System.out.println("Yes");
					return;
				}
			}
		}
		System.out.println("No");
	}

	static BigInteger binomial(final int N, final int K) {
		BigInteger ret = BigInteger.ONE;
		for (int k = 0; k < K; k++) {
			ret = ret.multiply(BigInteger.valueOf(N - k))
					.divide(BigInteger.valueOf(k + 1));
		}
		return ret;
	}

	static void line() throws IOException {
		st = new StringTokenizer(br.readLine());
	}

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

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

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

	static String nextToken() {
		return st.nextToken();
	}

}

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;

public class test_a {

	public static void main(String[] args) {
		MyScanner sc = new MyScanner();
		int a = sc.nextInt(), b = sc.nextInt(), c=sc.nextInt();
		int o=0;
		for(int y=0;;y++){
			int x1 = (c-b*y)/a;
			int x2 = (c-a*y)/b;
			if (x1>=0&&a*x1+b*y==c || x2>=0&&a*x2+b*y==c ){
				o=1;
				break;
			} else if (x1<0 && x2<0)break;
		}

		System.out.println(o==1?"Yes":"No");
	}

	// -----------PrintWriter for faster output---------------------------------
	public static PrintWriter out;

	// -----------MyScanner class for faster input----------
	public static class MyScanner {
		BufferedReader br;
		StringTokenizer st;

		public MyScanner() {
			br = new BufferedReader(new InputStreamReader(System.in));
		}

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

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

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

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

		String nextLine() {
			String str = "";
			try {
				str = br.readLine();
			} catch (IOException e) {
				e.printStackTrace();
			}
			return str;
		}
	}
	// --------------------------------------------------------
}

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int a= in.nextInt();
		int b= in.nextInt();
		int c= in.nextInt();
		for(int i=0;i<=10000;i++){
			for(int j=0;j<=10000;j++){
				if(i*a+j*b==c){
					System.out.println("Yes");
					return;
				}
			}
		}
		System.out.println("No");
	}

}

import java.util.Scanner;

public class Acm {
	public static void main(String args[]){
		Scanner sc= new Scanner(System.in);

		int a=sc.nextInt(); int b =sc.nextInt(); int c=sc.nextInt();
		int min =Math.min(b, a);
		boolean d= false ;
		while(true){

			if(c%a==0 ||c%b==0)
			{
				d=true;break ;
			}
			if(c<=0)break ;
			c=c-min ;
			//System.out.println(c);

		}
		System.out.println(d?"Yes":"No");

	}

	}

import java.util.*;
public class Codeforces {

    public static void main (String[] args){
 	Scanner s= new Scanner(System.in);
 	int a = s.nextInt();
 	int b = s.nextInt();
 	int x = s.nextInt();
 	String y = "No";
 	for(int i = x;i>=0;i-=b){
 		if(i==0||(i%a)==0){
 			y="Yes";
 		}
 	}

 	System.out.println(y);

	}
}

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub

		Scanner scan = new Scanner(System.in);

		int a = scan.nextInt();
		int b = scan.nextInt();
		int c = scan.nextInt();
		boolean found = false;
			for (int j=0; j<=c ; j++)
			{
				for (int k=0 ; k<=c ; k++){

					if( (j*a + k*b) == c){

						System.out.println("Yes");
						found=true;
					}

				}
				if(found== true)
                    break;

			}
		if(found == false){
			System.out.println("No");
		}

	}

}

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.lang.reflect.Array;
import java.math.BigInteger;
import java.security.interfaces.DSAKey;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.PriorityQueue;
import java.util.Queue;
import java.util.Scanner;
import java.util.Stack;
import java.util.StringTokenizer;
import java.util.TreeMap;
import java.util.TreeSet;

public class a {

	public static class in {
		static BufferedReader reader;
		static StringTokenizer tokenizer;

		static void init(InputStream input) {
			reader = new BufferedReader(new InputStreamReader(input));
			tokenizer = new StringTokenizer("");
		}

		static String next() throws IOException {
			while (!tokenizer.hasMoreTokens())
				tokenizer = new StringTokenizer(reader.readLine());
			return tokenizer.nextToken();
		}

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

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

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

	public static long comp(int n, int r) {
		r = Math.min(r, n - r);
		long ans = 1;
		for (int i = 1; i <= r; i++) {
			ans = ans * (long) (n - r + i) / (long) i;
		}
		return ans;

	}

	public static void main(String[] args) throws IOException {
		StringBuilder qq = new StringBuilder();
		in.init(System.in);
		PrintWriter out = new PrintWriter(System.out);
		// source code

		int a = in.nextInt();
		int b = in.nextInt();
		int c = in.nextInt();
		int coin[] = { a, b };
		int dp[] = new int[c + 1];
		dp[0] = 1;
		for (int i = 0; i < 2; i++) {
			for (int j = coin[i]; j <= c; j++) {
				dp[j] += dp[j - coin[i]];
			}
		}

		if(dp[c]!=0){
			System.out.println("Yes");
		}
		else
			System.out.println("No");

		out.close();

	}
}

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class A {

	public static void main(String[] args) throws Exception {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st = new StringTokenizer(br.readLine());
		int a = Integer.parseInt(st.nextToken());
		int b = Integer.parseInt(st.nextToken());
		int c = Integer.parseInt(st.nextToken());
		boolean ret = false;
		for (int i = 0; i < 10_001; i++) {
			if ((c - i * a) >= 0 && (c - i * a) % b == 0) {
				ret = true;
				break;
			}
		}
		System.out.println(ret ? "Yes" : "No");
	}
}

import java.util.Scanner;

public class CManthanA {

	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int a = scan.nextInt();
		int b = scan.nextInt();
		int c = scan.nextInt();

		int i=0;
		while (i*a <= c) {
			if ((c-i*a)%b==0) {
				System.out.println("Yes");
				return;
			}
			i++;
		}

		System.out.println("No");
	}

}

import java.util.*;

import static java.lang.Math.abs;
import static java.lang.Math.max;
import static java.lang.Math.min;

public class Abc {
    static int x, y, g;

    public static void main(String[] args) {

        Scanner sc = new Scanner(System.in);
        int a, b, c, x1, x2, y1, y2;
        a = sc.nextInt();
        b = sc.nextInt();
        c = sc.nextInt();
//        x1 = sc.nextInt();
//        x2 = sc.nextInt();
//        y1 = sc.nextInt();
//        y2 = sc.nextInt();

//        if (a == 0 && b == 0) {
//            if (c == 0) {
//                long total = (long) (x2 - x1 + 1) * (long) (y2 - y1 + 1);
//                System.out.println(total);//all combinations of x,y within the limits...
//            } else {
//                System.out.println(0);
//            }
//        } else if (a == 0) {
//            if (c % b == 0 && -c / b >= y1 && -c / b <= y2) { // this also includes case when c=0 i.e eg: 0%2==0
//                System.out.println((x2 - x1) + 1);
//            } else {
//                System.out.println(0);
//            }
//        } else if (b == 0) {
//            if (c % a == 0 && -c / a >= x1 && -c / a <= x2) { // this also includes case when c=0 i.e eg: 0%2==0
//                System.out.println((y2 - y1) + 1);
//            } else {
//                System.out.println(0);
//            }
//        } else {
        if (findTotalDiophantineSol(a, b, c, 0, 10000, 0, 10000)==0) {
            System.out.printf("No");
            System.out.println();

        } else {
            System.out.printf("Yes");
            System.out.println();
        }
//            System.out.println(findTotalDiophantineSol(a, b, c, 1, 10000, 1, 10000));
//        }

    }

    static int gcd(int a, int b) {
        if (a == 0) {
            x = 0;
            y = 1;
            return b;
        }
        g = gcd(b % a, a);
        int x1 = y - (b / a) * x;
        int y1 = x;
        x = x1;
        y = y1;
        return g;
    }

    static boolean findAnyDiophantineSol(int a, int b, int c) {
        g = gcd(a, b);
//        System.out.println(g+" "+x+" "+y);
        if (c % g != 0) {
            return false;
        }
        x = (c / g) * x;
        y = (c / g) * y;
        if (a < 0) x *= -1;
        if (b < 0) y *= -1;
        return true;
    }

    static int[] shift_solution(int x, int y, int a, int b, int cnt) {
        x += cnt * b;
        y -= cnt * a;
        return new int[]{x, y};
    }

    static int findTotalDiophantineSol(int a, int b, int c, int minx, int maxx, int miny, int maxy) {
        if (!findAnyDiophantineSol(a, b, c))
            return 0;
        a /= g;
        b /= g;

        int sign_a = a > 0 ? +1 : -1;
        int sign_b = b > 0 ? +1 : -1;

        int[] arr = shift_solution(x, y, a, b, (minx - x) / b);
        x = arr[0];
        y = arr[1];
        if (x < minx) {
            arr = shift_solution(x, y, a, b, sign_b);
            x = arr[0];
            y = arr[1];
        }
        if (x > maxx)
            return 0;
        int lx1 = x;

        arr = shift_solution(x, y, a, b, (maxx - x) / b);
        x = arr[0];
        y = arr[1];
        if (x > maxx) {
            arr = shift_solution(x, y, a, b, -sign_b);
            x = arr[0];
            y = arr[1];
        }
        int rx1 = x;

        arr = shift_solution(x, y, a, b, -(miny - y) / a);
        x = arr[0];
        y = arr[1];
        if (y < miny) {
            arr = shift_solution(x, y, a, b, -sign_a);
            x = arr[0];
            y = arr[1];
        }
        if (y > maxy)
            return 0;
        int lx2 = x;

        arr = shift_solution(x, y, a, b, -(maxy - y) / a);
        x = arr[0];
        y = arr[1];
        if (y > maxy) {
            arr = shift_solution(x, y, a, b, sign_a);
            x = arr[0];
            y = arr[1];
        }
        int rx2 = x;

        if (lx2 > rx2) {//swap
            int temp = lx2;
            lx2 = rx2;
            rx2 = temp;
        }

        int lx = max(lx1, lx2);
        int rx = min(rx1, rx2);

        if (lx > rx)
            return 0;
        return (rx - lx) / abs(b) + 1;
    }
}

import java.util.*;
public class la6 {
	public static void main (String[]args){
	Scanner sc =new Scanner (System.in);
	int a=sc.nextInt();
	int b=sc.nextInt();
	int c=sc.nextInt();
	boolean p=false;
	if (c%a==0||c%b==0){
      p=true;}
      else {
      	for(int i=1;i<c;i++){
      		for(int j=1;j<c;j++){
      		if (i*a+j*b==c){
      			p=true;
      			break;}

      		}
      		}
      }
if (p==false)
System.out.print("no");
else
System.out.print("yes");
	}
}

import java.util.Scanner;
public class EbonyAndIvory {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int a = in.nextInt();
		int b = in.nextInt();
		int c = in.nextInt();

		int x = c;
		boolean done = false;
		while (x >= 0) {
			if (x % a == 0) {
				done = true;
				break;
			}
			else {
				x = x - b;
			}
		}
		if (done) {
			System.out.println("YES");
		}
		else {
			System.out.println("NO");
		}
	}
}

import java.util.*;
public class acm {

	public static void main(String[] args) {
	    Scanner sc = new Scanner(System.in);
		double a = sc.nextInt();double b = sc.nextInt();double c = sc.nextInt();
		boolean flag=false;double n;double m=0;
		n= (c-m*b)/a;

		while(m<c && flag!=true){
			n= (c-m*b)/a;

			if(((int)n)==n)
				flag=true;
			else
				m++;

		}
		if((flag && ((n*a)+(m*b))==c && !(n<0))|| m*b == c)
			System.out.println("Yes");
		else
			System.out.println("No");

	   }}

//package ebony_and_ivory_cf633a;

import java.util.Scanner;

public class Ebony_and_Ivory_CF633A {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int a = in.nextInt(), b = in.nextInt(), c = in.nextInt();
        boolean isPossible = false;
        int mult = 0;

        while (mult <= c) {
            if ((c - mult) % a == 0) {
                isPossible = true;
                break;
            } else
                mult += b;
        }

        if (isPossible)
            System.out.println("Yes");
        else
            System.out.println("No");
    }
}

import java.io.*;
import java.util.*;

public class First {
    private static final Scanner sc = new Scanner(System.in);
    private static final PrintWriter pw = new PrintWriter(System.out);
    private static StringBuffer ans = new StringBuffer();

    public static void main(String[] args) throws Exception {
        int a = sc.nextInt(), b = sc.nextInt(), c = sc.nextInt();
        if (c % gcd(a, b) != 0) ans.append("No");
        else {
            boolean found = false;
            for (int x = 0; x * a <= c && !found; x++)
                for (int y = 0; y * b <= c - (x * a) && !found; y++)
                    if (y * b == c - (x * a))
                        found = true;
            if (!found) ans.append("No");
            else ans.append("Yes");
        }
        pw.print(ans);
        sc.close();
        pw.close();
    }

    private static int gcd(int a, int b) {
        return b == 0 ? a : gcd(b, a % b);
    }
}

class Scanner {
    private final BufferedReader br;
    private StringTokenizer st;

    public Scanner(InputStream in) {
        br = new BufferedReader(new InputStreamReader(in));
        st = new StringTokenizer("");
    }

    public String next() throws IOException {
        if (!st.hasMoreTokens())
            st = new StringTokenizer(br.readLine());
        return st.nextToken();
    }

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

    public void close() throws IOException {
        br.close();
    }
}

class PrintWriter {
    private final BufferedOutputStream pw;

    public PrintWriter(OutputStream out) {
        pw = new BufferedOutputStream(out);
    }

    public void print(Object o) throws IOException {
        pw.write(o.toString().trim().getBytes());
        pw.flush();
    }

    public void println(Object o) throws IOException {
        print(o + "\n");
    }

    public void close() throws IOException {
        pw.close();
    }
}

import java.util.Scanner;

public class Ebony
{
   public static void main(String args[])
   {
      int a, b, c;

      Scanner in = new Scanner(System.in);
      a = in.nextInt();
      b = in.nextInt();
      c = in.nextInt();

		for (int i=0; i < c/a+2; i++) {
			for (int j=0; j < c/b+2; j++) {
				if (i*a+j*b==c) {
					System.out.print("Yes");
					System.exit(0);
				}
			}
		}
		System.out.print("No");
    }
 }

import java.util.Scanner;

public class Main {
	private static Scanner cin = new Scanner(System.in);
	public static void main(String[] args) {
		int a = cin.nextInt();
		int b = cin.nextInt();
		int c = cin.nextInt();
		while(c >= 0){
			if(c % b == 0){
				System.out.println("YES");
				return ;
			}
			c -= a;
		}
		System.out.println("NO");
	}
}

/* package codechef; // don't place package name! */

import java.util.*;
import java.lang.*;
import java.io.*;

/* Name of the class has to be "Main" only if the class is public. */
public class Main
{
   static boolean solution(int a, int b, int n)
	{
		for (int i = 0; i * a <= n; i++)
		{
			if ((n - (i * a)) % b == 0)
			{

				return true;
			}
		}

		return false;
	}

  public static void main (String[] args) throws java.lang.Exception
   {
	try{
	    Scanner sc=new Scanner(System.in);
		   int a=sc.nextInt();
		      int b=sc.nextInt();
		      int c=sc.nextInt();
		     if(solution(a,b,c))
		       System.out.println("Yes");
		    else
		     System.out.println("No");

	   }
	catch(Exception e)
		 {}
	}
}

import java.util.Scanner;
public class EbonyAndIvory {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
int ebonyDamage = input.nextInt();
int ivoryDamage = input.nextInt();
int shieldHealth = input.nextInt();
boolean flag = false;
if(shieldHealth%ebonyDamage==0 || shieldHealth%ivoryDamage==0){
flag = true;
}else{
while(shieldHealth!=ebonyDamage || shieldHealth!=ivoryDamage ||
shieldHealth>(ivoryDamage+ebonyDamage)){
shieldHealth = shieldHealth-(ebonyDamage+ivoryDamage);
if((shieldHealth%ebonyDamage==0 && shieldHealth>=0) ||
(shieldHealth%ivoryDamage==0 && shieldHealth>=0)){
flag = true;
break;
}else if(shieldHealth<ebonyDamage && shieldHealth<ivoryDamage){
flag = false;
break;
}
}
}
if(flag==true){
System.out.println("Yes");
}else
System.out.println("No");
}
}

import java.io.*;
import java.util.*;
public class Solution
{
    static long gcd;
    static long x,y;
    public static void main(String ag[])
    {
        Scanner sc=new Scanner(System.in);

        long A=sc.nextLong();
        long B=sc.nextLong();
        long C=sc.nextLong();
        gcd(A,B);

        if(C%gcd!=0)
        System.out.println("No");

        else
        {
            x*=C/gcd;
            y*=C/gcd;
            if(x>=0&&y>=0)
            System.out.println("Yes");
            else if(x<0)
            {
                while(x<0)
                {
                    x+=B/gcd;
                    y-=A/gcd;
                }
                if(x>=0&&y>=0)
                System.out.println("Yes");
                else
                System.out.println("No");
            }
            else
            {
                while(y<0)
                {
                    x-=B/gcd;
                    y+=A/gcd;
                }
                if(x>=0&&y>=0)
                System.out.println("Yes");
                else
                System.out.println("No");
            }

        }
    }
    public static void gcd(long A,long B)
    {
        if(B==0)
        {
            x=1;
            y=0;
            gcd=A;
        }
        else
        {
            gcd(B,A%B);
            long temp=x;
            x=y;
            y=temp-(A/B)*y;
        }
    }

}

import java.util.Scanner;

/**
 *
 * @author Raed
 */
public class EboneyAndIvory {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        // TODO code application logic here

        Scanner input = new Scanner(System.in);

        int a = input.nextInt();
        int b = input.nextInt();
        int c = input.nextInt();

        if(b<a){

            int temp = a;
            a=b;
            b=temp;
        }

        boolean found=false;

        if(c%a==0 || c%b==0){

            found=true;
            System.out.println("YES");
        }

        if(!found){
        int n = (int)Math.floor((double)c/a);

        int a2=a;
        for( int i=0;i<n;i++){

            int mid = c-a2;
            if(mid%b ==0){

                System.out.println("YES");
                found=true;
                break;
            }
            a2=a*(i+1);
        }}

        if(!found){

             int m = (int)Math.floor((double)c/b);
             int b2=b;
             for( int i=0;i<m;i++){

            int mid = c-b2;
            if(mid%a ==0){

                System.out.println("YES");
                found=true;
                break;
            }
            b2=b*(i+1);
        }

        }
        if(!found){
         System.out.println("NO");
        }

    }

}

import java.util.*;

public class Sample {
	public static void main(String[] args){

	  Scanner kbd = new Scanner(System.in);
	  int a = kbd.nextInt();
	  int b = kbd.nextInt();
	  int c = kbd.nextInt();
	  int flag = 0;
	  int i = 0;

		  for(i=0;i<=10000;i++){
			  if((c-i*b)%a==0){
			    if(((c-i*b)/a)<0)
			     break;
			     System.out.println("Yes");

			     flag=1;
			     break;

			  }
		  }
			  if(flag==0){
			   System.out.println("No");
			  }

	 }

}

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class ebonyAndevory {
	public static void main(String[]args) throws IOException{
		BufferedReader br =new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer str=new StringTokenizer(br.readLine());
		int a = Integer.parseInt(str.nextToken());
		int b = Integer.parseInt(str.nextToken());
		int c = Integer.parseInt(str.nextToken());
		int sum = 0;
		int[]array=new int[2];
		boolean flag=false;
		for (int i = 0; i < 10000; i++) {
			for (int j = 0; j < 10000; j++) {
				if (a*i+b*j==c) {
					flag=true;
					break;
				}
			}

		}
		if (flag) {
			System.out.println("Yes");

		}else
		System.out.println("No");

	}

}

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Iterator;
import java.util.List;
import java.util.StringTokenizer;
import java.util.TreeMap;

public class Template {

    static PrintWriter out = new PrintWriter(System.out);

    static void input() throws IOException {
        Reader.init(System.in);
    }

    // Main Method....
    public static void main(String[] args) throws IOException {

        input();
        solve();
    }

    // Solution goes here........
    static void solve() throws IOException {

        int e = Reader.nextInt();
        int i = Reader.nextInt();
        int c = Reader.nextInt();
        boolean found = false;

        if (c != 0) {
            found = solve2(e, i, c);
        }

        if (found) {
            out.println("Yes");
        } else {
            out.println("No");
        }
        out.flush();
        out.close();

    }

    static boolean solve2(int a, int b, int c) {

      while(c>=0){

              if(c%b == 0)
                  return true;

              c-=a;

      }

      return false;

    }

    //////////////////////////////// No Business TO DO HERE... Up Up ^^^
    static class Reader {

        static BufferedReader reader;
        static StringTokenizer tokenizer;

        static void init(InputStream input) {
            reader = new BufferedReader(new InputStreamReader(input));
            tokenizer = new StringTokenizer("");
        }

        static String next() throws IOException {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {

                tokenizer = new StringTokenizer(reader.readLine());
            }
            return tokenizer.nextToken();
        }

        static String nextLine() throws IOException {
            return reader.readLine();
        }

        static char nextChar() throws IOException {
            return (char) reader.read();
        }

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

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

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

        static long[] nextLongArray(int n) throws IOException {
            long[] arr = new long[n];
            for (int i = 0; i < n; i++) {
                arr[i] = nextLong();
            }

            return arr;
        }

        static int[] nextIntArray(int n) throws IOException {
            int[] arr = new int[n];
            for (int i = 0; i < n; i++) {
                arr[i] = nextInt();
            }
            return arr;
        }

    }

}

import java.io.*;
import java.util.*;
import java.lang.*;

public class Test1{
  public static void main(String args[]){

    Scanner sc = new Scanner(System.in);

    int a = sc.nextInt();
    int b = sc.nextInt();
    int c = sc.nextInt();
    int ch=0;
    int p = c/a;
    int q = c/b;
    for(int i=0;i<=p;i++){
      for(int j=0;j<=q;j++){
        if(a*i+b*j==c)
        {
          ch=1;
          break;
        }
      }
    }

    if(ch==1)
      System.out.println("YES");
    else
      System.out.println("NO");

  }
}

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Solution {
    public static void main(String[] args) throws IOException {
        BufferedReader in = new BufferedReader(new InputStreamReader(System.in));

        String [] raw = in.readLine().split(" ");

        int a = Integer.parseInt(raw[0]);
        int b = Integer.parseInt(raw[1]);
        int c = Integer.parseInt(raw[2]);

        for (int x = 0; x < 10000; x++){
            if (x * a <= c && (c - x * a) % b == 0){
                System.out.println("Yes");
                return;
            }
        }

        System.out.println("No");

        in.close();
    }
}

import java.util.*;
public class first{
	public static void main(String[]args){
		Scanner inp = new Scanner(System.in);
		double x = inp.nextInt();
		double y = inp.nextInt();
		double z = inp.nextInt();
		double j;
		for(double i = 0.0;;i=i+1){
			if(i*y > z){
				System.out.println("No");
				break;}
			if(((z-y*i)/x)%1.0 == 0.0){
				System.out.println("Yes");
				break;
			}
	}
	}
}

import java.util.Scanner;

public class Task01 {

public static void main(String[] args) {
	Scanner input = new Scanner(System.in);
	long a = input.nextLong();
	long b = input.nextLong();
	long c = input.nextLong();
	long x,y;
	String rez="No";
	if (a==c||b==c||c%a==0||c%b==0){rez="Yes";}
	else if (a<=c||b<=c){
		for (long i=1; i<=c; i++){
			x=i;
			if (a*x>c){break;}
			y=(c-a*x)%b;
			if (y==0){
				rez="Yes";
				break;
			}
		}
	}
	System.out.print(rez);
	}
}

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());
		}
	}
}

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class EbonyAndIvory {
	public static void main(String[] args) {
		InputReader r = new InputReader(System.in);
		int a = r.nextInt();
		int b = r.nextInt();
		int c = r.nextInt();
		for (int x = 0; x <= 10005; x++) {
			int start = c - x * a;
			start /= b;
			start -= 5;
			for (int y = Math.max(0, start); y <= 10005; y++) {
				if (x * a + y * b == c) {
					System.out.println("Yes");
					return;
				}
			}
		}
		System.out.println("No");
	}

	static class InputReader {
		private BufferedReader reader;
		private StringTokenizer tokenizer;

		public InputReader(InputStream stream) {
			reader = new BufferedReader(new InputStreamReader(stream));
			tokenizer = null;
		}

		public InputReader(FileReader stream) {
			reader = new BufferedReader(stream);
			tokenizer = null;
		}

		public String nextLine() {
			try {
				return reader.readLine();
			} catch (IOException e) {
				// TODO Auto-generated catch block
				e.printStackTrace();
				return null;
			}
		}

		public String next() {
			while (tokenizer == null || !tokenizer.hasMoreTokens()) {
				try {
					tokenizer = new StringTokenizer(reader.readLine());
				} catch (IOException e) {
					throw new RuntimeException(e);
				}
			}
			return tokenizer.nextToken();
		}

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

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

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

import java.io.*;
import java.util.*;

public class NumbersColoring {
	public static void main(String[] args) throws IOException {
		InputReader reader = new InputReader();
		int a = reader.nextInt(), b = reader.nextInt(), c = reader.nextInt();
		List<Integer> listA = new ArrayList<Integer>();
		List<Integer> listB = new ArrayList<Integer>();
		int i = 0;
		while (a * i <= c || b * i <= c) {
			listA.add(a * i);
			listB.add(b * i);
			i++;
		}
		boolean check = false;
		if (listA.contains(c) || listB.contains(c)) {
			check = true;
		} else
			for (int j = 0; j < listA.size(); j++) {
				if (listB.contains(c - listA.get(j))) {
					check = true;
					break;
				}
			}
		System.out.print(check ? "Yes" : "No");
	}

	public static long gcd(long a, long b) {
		return b == 0 ? Math.abs(a) : gcd(b, a % b);
	}

	static class InputReader {

		InputStream is = System.in;
		byte[] inbuf = new byte[1 << 25];
		int lenbuf = 0, ptrbuf = 0;

		public InputReader() throws IOException {
			lenbuf = is.read(inbuf);
		}

		public int readByte() {

			if (ptrbuf >= lenbuf) {
				return -1;
			}

			return inbuf[ptrbuf++];
		}

		public boolean hasNext() {
			int t = skip();

			if (t == -1) {
				return false;
			}
			ptrbuf--;
			return true;
		}

		public boolean isSpaceChar(int c) {
			return !(c >= 33 && c <= 126);
		}

		public int skip() {
			int b;
			while ((b = readByte()) != -1 && isSpaceChar(b))
				;
			return b;
		}

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

		public char nextChar() {
			return (char) skip();
		}

		public String next() {
			int b = skip();
			StringBuilder sb = new StringBuilder();
			while (!(isSpaceChar(b))) {
				sb.appendCodePoint(b);
				b = readByte();
			}
			return sb.toString();
		}

		public char[] ns(int n) {
			char[] buf = new char[n];
			int b = skip(), p = 0;
			while (p < n && !(isSpaceChar(b))) {
				buf[p++] = (char) b;
				b = readByte();
			}
			return n == p ? buf : Arrays.copyOf(buf, p);
		}

		public char[][] nm(int n, int m) {
			char[][] map = new char[n][];
			for (int i = 0; i < n; i++) {
				map[i] = ns(m);
			}
			return map;
		}

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

		public int nextInt() {
			int num = 0, b;
			boolean minus = false;
			while ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))
				;
			if (b == '-') {
				minus = true;
				b = readByte();
			}

			while (true) {
				if (b >= '0' && b <= '9') {
					num = num * 10 + (b - '0');
				} else {
					return minus ? -num : num;
				}
				b = readByte();
			}
		}

		public long nextLong() {
			long num = 0;
			int b;
			boolean minus = false;
			while ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))
				;
			if (b == '-') {
				minus = true;
				b = readByte();
			}

			while (true) {
				if (b >= '0' && b <= '9') {
					num = num * 10 + (b - '0');
				} else {
					return minus ? -num : num;
				}
				b = readByte();
			}
		}

	}
}

import java.io.*;

public class MyClass {
    static int x;
    static int y;
    static int d;

    public static void main(String args[]) throws IOException{
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        String[] vals = br.readLine().split(" ");
        int a = Integer.parseInt(vals[0]);
        int b = Integer.parseInt(vals[1]);
        int c = Integer.parseInt(vals[2]);

        int d = eed(a, b);
        if((c >= a || c >= b) && (c%d) == 0){
            int l = 0;
            int u = 0;
            //System.out.println(x + ", " + y);
            if(x >= 0)
                l = -(x*c*d) /b;
            else
                l = (-x*c*d + b - 1)/b;
            if(y >= 0)
                u = (y*c*d) /a;
            else
                u = -(-y*c*d + a - 1)/a;
            //System.out.println(l + ", " + u);
            if(u >= l){
                System.out.println("Yes");
            }
            else
                System.out.println("No");
        }
        else
            System.out.println("No");

    }

    static int eed(int a, int b){
        if(b == 0){
            x = 1;
            y = 0;
            return a;
        }

        d = eed(b, a%b);
        int temp = x;
        x = y;
        y = temp - (a/b)*y;
        return d;
    }
}

import java.util.Scanner;

public class codeforces {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner scan = new Scanner(System.in);

		int a = scan.nextInt();
		int b = scan.nextInt();
		int c = scan.nextInt();
		boolean found = false;
			for (int j=0; j<=c ; j++)
			{
				for (int k=0 ; k<=c ; k++){

					if( (j*a + k*b) == c){

						System.out.println("Yes");
						found=true;
					}

				}
				if(found== true)
                    break;

			}
		if(found == false){
			System.out.println("No");
		}

	}
	}

import java.util.*;
public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        try {
            int a, b, c;
            a =sc.nextInt();
            b =sc.nextInt();
            c =sc.nextInt();
            for(int i = 0 ; i< 10000; i++){
                int d = (c - (b*i));
                if( d <0){
                    System.out.println("No");
                    return;
                }
                if( d % a == 0){
                    System.out.println("Yes");
                    return;
                }
            }
       } catch (Exception e) {}

    }
}

import java.io.IOException;
import java.util.*;

public class Main {

	public static void main(String[] args) throws NumberFormatException, IOException {
		Scanner scn = new Scanner(System.in);
		int a = scn.nextInt();
		int b = scn.nextInt();
		int c = scn.nextInt();

		if (find_any_solution(a, b, c)) {
			System.out.println("Yes");
		} else {
			System.out.println("No");
		}
		//System.out.println(x + " " + y + " " + g);
	}

	static int x, y, g;

	public static boolean find_any_solution(int a, int b, int c) {
		g = extendedeuclid(a, b);

		x *= c / g;
		y *= c / g;

		if (c % g != 0) {
			return false;
		}
		if (x >= 0 && y >= 0) {
			return true;
		} else if (x < 0 && y > 0) {
			while (x < 0) {
				x = x + b / g;
				y = y - a / g;
			}
			if (y >= 0) {
				return true;
			}
		} else if (x > 0 && y < 0) {
			while (y < 0) {
				x = x - b / g;
				y = y + a / g;
			}
			if (x >= 0) {
				return true;
			}
		}
		return false;
	}

	public static int extendedeuclid(int a, int b) {
		if (a == 0) {
			x = 0;
			y = 1;
			return b;
		}

		int x1;
		int y1;
		int gcd = extendedeuclid(b % a, a);

		x1 = x;
		y1 = y;

		x = y1 - (b / a) * x1;
		y = x1;
		return gcd;
	}
}

import java.util.Scanner;

public class mahmoud {

	public static void main (String[] args)
	{
		Scanner sc = new Scanner(System.in);

		int x = sc.nextInt();
		int y = sc.nextInt();
		int z = sc.nextInt(); boolean flag = false;
		if (x>y){
			int temp = x;
			x = y;
			y = temp;
		}
		if (z%x ==0 || z%y ==0 )
			System.out.println("Yes");
		else {
		while (z >= 0){
			z-=x;
			if (z%y==0)
			{ flag= true; break;
			}
		}
		if(flag)
			System.out.print("Yes");
			else
			{

					System.out.println("No");

			}

		}
	}

}

import java.util.*  ;
public class ebonyivory {

	public static void main(String[] args) {
		Scanner ss = new Scanner (System.in)  ;
		int a  = ss.nextInt() ;
		int b = ss.nextInt()  ;
		int c = ss.nextInt()  ;
		int t = 0 ; int f = 0 ;
		if (c==a || c== b){
			t=c ;
		}
		else{
		for (int x = 0;x<100; x++){
			t = 0 ;
			for(int y = 0 ;t<c ; y++){
				t= x*a+y*b ;
			}
			 if (t==c)
				 break ;

		}
		if (t!=c){
			for (int j = 0;j<100; j++){
				f = 0 ;
				for(int i = 0 ;f<c ; i++){
					f= i*a+j*b ;
				}
				 if (f==c)
					 break ;

			}
		}
		}
		if (t == c || f == c )
			System.out.println("YES");
		else
			System.out.println("NO");
	}

}

import java.io.*;
import java.lang.*;
import java.lang.*;
public class P{
	public static void gcd(int a,int b,int[] arr) {
		if(b==0) {
			arr[0]=1;
			arr[1]=0;
			arr[2]=a;
		}
		else {
			gcd(b,a%b,arr);
			int temp=arr[0];
			arr[0]=arr[1];
			arr[1]=temp-(a/b)*arr[1];
		}
	}
	public static boolean cond(int x,int y,int e,int f) {
		int factor;
	    if(x>y) {
	    	if(y%f==0) {factor=Math.abs(y/f);}
	    	else {factor=Math.abs(y/f)+1;}
	    	if(x-(e*factor)>=0) {return true;}
	    	else {return false;}
	    }
	    else {
	    	if(x%e==0) {factor=Math.abs(x/e);}
	    	else {factor=Math.abs(x/e)+1;}
	    	if(y-(f*factor)>=0) {return true;}
	    	else {return false;}

	    }
	}
	public static void main(String[] args) throws IOException {
		BufferedReader bf=new BufferedReader(new InputStreamReader(System.in));
		String[] input1=bf.readLine().split(" ");
		int A=Integer.parseInt(input1[0]);
		int B=Integer.parseInt(input1[1]);
		int C=Integer.parseInt(input1[2]);
		int[] outputs=new int[3];
		gcd(A,B,outputs);
		if(C%outputs[2]==0) {
			//System.out.println(outputs[0]);
			//System.out.println(outputs[1]);
			if(outputs[0]>=0&&outputs[1]>=0) {
				System.out.println("Yes");
			}
			else {
				int x0=outputs[0]*(C/outputs[2]);
				int y0=outputs[1]*(C/outputs[2]);
				int xf=B/outputs[2];
				int yf=A/outputs[2];
				//System.out.printf("%d %d %d %d", x0,y0,xf,yf);
				if(cond(x0,y0,xf,yf)) {
					System.out.println("Yes");
				}
				else {
					System.out.println("No");
				}
			}
		}
		else {
			System.out.println("No");
		}

	}
}

import java.util.Scanner;

public class EbonyIvory {
	public static void main (String [] args){
		Scanner sc = new Scanner(System.in);
		int a = sc.nextInt();
		int b = sc.nextInt();
		int c = sc.nextInt();
		for(int x =0; x <= c ; x++){

			if((x % a==0)&&(c-x)%b ==0){
				System.out.println("YES");
				return;
			}
		}
		System.out.println("NO");

	}
}

import java.math.*;
import java.io.*;
import java.util.*;
import java.awt.*;
public class Manthancodea
{
	StringTokenizer st;
	BufferedReader in;
	PrintWriter ob;
	public static void main(String args[])throws IOException {
		new Manthancodea().run();
	}
	void run()throws IOException   {
		//in=new BufferedReader(new FileReader("input.txt"));
		//ob=new PrintWriter("output.txt");
		in=new BufferedReader(new InputStreamReader(System.in));
		ob=new PrintWriter(System.out);
		solve();
		ob.flush();
	}
	void solve()throws IOException {
		read();
		int a=ni();
		int b=ni();
		int c=ni();
		int flag=0;
		for(int i=0;;i++){
			double sub=(i*b);
			double x=(c-sub)/(double)a;
			//System.out.println(x);
			if(x<0.0)
			{
				break;
			}
			if((double)(x-(int)x)==0.00000000000000000)
			{
				flag=1;
			//	System.out.println(x);
				break;
			}
		}
		ob.println(flag==1?"Yes":"No");
	}
	void read()throws IOException  {
		st=new StringTokenizer(in.readLine());
	}
	int ni(){
		return Integer.parseInt(st.nextToken());
	}
	long nl(){
		return Long.parseLong(st.nextToken());
	}
	double nd(){
		return Double.parseDouble(st.nextToken());
	}
	String ns(){
		return st.nextToken();
	}
	char nc(){
		return st.nextToken().charAt(0);
	}
	int[] nia(int n)throws IOException {
		int a[]=new int[n];
		read();
		for(int i=0;i<n;i++){
			a[i]=Integer.parseInt(st.nextToken());
		}
		return a;
	}
	long[] nla(int n)throws IOException {
		long a[]=new long[n];
		read();
		for(int i=0;i<n;i++){
			a[i]=Long.parseLong(st.nextToken());
		}
		return a;
	}
}

import java.util.*;
public class Codeforces {

    public static void main (String[] args){
 	Scanner s= new Scanner(System.in);
 	int a = s.nextInt();
 	int b = s.nextInt();
 	int x = s.nextInt();
 	String y = "No";
 	for(int i = x;i>=0;i-=b){
 		if(i==0||(i%a)==0){
 			y="Yes";
 		}
 	}

 	System.out.println(y);

	}
}

/**
 * @(#)EbonyAndIvory.java
 *
 *
 * @Del Rosario, Jerome
 * @Medina, Isaac Immanuel
 * @version 1.00 2016/8/24
 */

import java.util.Scanner;

public class EbonyAndIvory {
    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);

        int ebonyDamage = input.nextInt();
        int ivoryDamage = input.nextInt();
        int shieldHealth = input.nextInt();

        boolean flag = false;
        if(shieldHealth%ebonyDamage==0 || shieldHealth%ivoryDamage==0){
        	flag = true;
        }else{
        	while(shieldHealth!=ebonyDamage || shieldHealth!=ivoryDamage || shieldHealth>(ivoryDamage+ebonyDamage)){
        		shieldHealth = shieldHealth-(ebonyDamage+ivoryDamage);
        		if((shieldHealth%ebonyDamage==0 && shieldHealth>=0) || (shieldHealth%ivoryDamage==0 && shieldHealth>=0)){
        			flag = true;
        			break;
        		}else if(shieldHealth<ebonyDamage && shieldHealth<ivoryDamage){
        			flag = false;
        			break;
        		}
        	}
        }

        if(flag==true){
			System.out.println("Yes");
		}else
			System.out.println("No");
    }
}

import java.io.*;
import java.util.*;
public class Solution
{
    static long gcd;
    static long x,y;
    public static void main(String ag[])
    {
        Scanner sc=new Scanner(System.in);

        long A=sc.nextLong();
        long B=sc.nextLong();
        long C=sc.nextLong();
        gcd(A,B);

        if(C%gcd!=0)
        System.out.println("No");

        else
        {
            x*=C/gcd;
            y*=C/gcd;
            if(x>=0&&y>=0)
            System.out.println("Yes");
            else if(x<0)
            {
                while(x<0)
                {
                    x+=B/gcd;
                    y-=A/gcd;
                }
                if(x>=0&&y>=0)
                System.out.println("Yes");
                else
                System.out.println("No");
            }
            else
            {
                while(y<0)
                {
                    x-=B/gcd;
                    y+=A/gcd;
                }
                if(x>=0&&y>=0)
                System.out.println("Yes");
                else
                System.out.println("No");
            }

        }
    }
    public static void gcd(long A,long B)
    {
        if(B==0)
        {
            x=1;
            y=0;
            gcd=A;
        }
        else
        {
            gcd(B,A%B);
            long temp=x;
            x=y;
            y=temp-(A/B)*y;
        }
    }

}

import java.awt.Point;
import java.io.*;
import java.lang.reflect.Array;
import java.math.BigInteger;
import java.util.*;
import static java.lang.Math.*;
import java.math.BigDecimal;

/**
 *
 * @author Mojtaba
 */
public class Main {

    public static void main(String[] args) throws IOException, Exception {
        MyScanner in = new MyScanner(System.in);
        //Scanner in = new Scanner(System.in);
        //Scanner in = new Scanner(new File("input.txt"));

        PrintWriter writer = new PrintWriter(new BufferedOutputStream(System.out));
        StringBuilder sb = new StringBuilder("");

        int a = in.nextInt();
        int b = in.nextInt();
        int c = in.nextInt();
        // ax + by = c
        boolean ok = false;
        search:
        {
            for (int x = 0; x <= c; x += a) {
                if ((c - x) % b == 0) {
                    ok = true;
                    break search;
                }
            }
        }
        sb.append(ok ? "Yes" : "No");

        writer.println(sb.toString().trim());
        writer.flush();
        in.close();
    }
}

class MyScanner {

    BufferedReader reader;
    StringTokenizer tokenizer;

    public MyScanner(InputStream stream) {
        this.reader = new BufferedReader(new InputStreamReader(stream));
    }

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

    public int[] nextIntegerArray(int n) throws IOException {
        int[] a = new int[n];
        for (int i = 0; i < a.length; i++) {
            a[i] = nextInt();
        }
        return a;
    }

    public long[] nextLongArray(int n) throws IOException {
        long[] a = new long[n];
        for (int i = 0; i < a.length; i++) {
            a[i] = nextLong();
        }
        return a;
    }

    public int nextInt(int radix) throws IOException {
        return Integer.parseInt(next(), radix);
    }

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

    public long nextLong(int radix) throws IOException {
        return Long.parseLong(next(), radix);
    }

    public double nextDouble() throws IOException {
        return Double.parseDouble(next());
    }

    public BigInteger nextBigInteger() throws IOException {
        return new BigInteger(next());
    }

    public BigInteger nextBigInteger(int radix) throws IOException {
        return new BigInteger(next(), radix);
    }

    public String next() throws IOException {
        if (tokenizer == null || !tokenizer.hasMoreTokens()) {
            tokenizer = new StringTokenizer(reader.readLine());
            return this.next();
        }
        return tokenizer.nextToken();
    }

    public void close() throws IOException {
        this.reader.close();
    }
}

import java.io.*;
import java.util.Scanner;
public class Main {
public static void main(String args[])throws IOException
{
	Scanner s1=new Scanner(System.in);
	int a=Integer.parseInt(s1.next());
	int b=Integer.parseInt(s1.next());
	int c=Integer.parseInt(s1.next());
	int flag=0;
	for(long i=0;i<=10000;i++)
	{
		for(long j=0;j<=10000;j++)
		{
			if((a*i)+(b*j)==c)
			{
				flag=1;
				break;
			}

		}
		if(flag==1)
			break;
	}
	if(flag==1)
		System.out.println("Yes");
	else
		System.out.println("No");
}
}

import java.util.Scanner;

public class Sample {
	public static void main(String[] args){
		Scanner sc=new Scanner(System.in);
		int a=sc.nextInt();
		int b=sc.nextInt();
		int c=sc.nextInt();

		System.out.println(EbonyAndIvory.solution2(a,b,c));
	}
}
class EbonyAndIvory {

    public static String solution1(int ebonyDamage, int ivoryDamage, int shieldHealth) {
    	if(shieldHealth%ebonyDamage==0 || shieldHealth%ivoryDamage==0){
        	return "Yes";
        }else{
        	while(!(shieldHealth<ebonyDamage && shieldHealth<ivoryDamage) && (shieldHealth!=ebonyDamage || shieldHealth!=ivoryDamage || shieldHealth>(ivoryDamage+ebonyDamage))){
        		shieldHealth = shieldHealth-(ebonyDamage+ivoryDamage);
        		if((shieldHealth%ebonyDamage==0 && shieldHealth>=0) || (shieldHealth%ivoryDamage==0 && shieldHealth>=0)){
        			return "Yes";
        		}
        	}
        	return "No";
        }
    }

    public static String solution2(int ebonyDamage, int ivoryDamage, int shieldHealth){
    	int flag = 0;
		for(int i=0; i<=10000; i++){
			if((shieldHealth-i*ivoryDamage)%ebonyDamage==0){
				if(((shieldHealth-i*ivoryDamage)/ebonyDamage)<0)
					break;
				return "Yes";
			}
		}
		return "No";
    }
}

import java.util.*;
public class EbonyAndIvory {
 public static void main(String[] args){
  Scanner in = new Scanner(System.in);

  int x = in.nextInt();
  int y = in.nextInt();
  int z = in.nextInt();
  int yes = 0;
  int i = 0;

  for(i = 0; i <= 10000; i++){
   if((z - i * y) %x == 0){
    if(((z - i * y) /x) < 0)
     break;
    System.out.println("Yes");

    yes = 1;
    break;
   }
  }

  if(yes == 0)
   System.out.println("No");
 }
}

import java.util.Scanner;

public class TemniySvetliy {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int a = scanner.nextInt();
        int b = scanner.nextInt();
        int c = scanner.nextInt();

        int sum = 10001;
        String word = "No";
        int first = c / a;
        int second = c / b;
        if (first == 0) {
            first = 1;
        }
        if (second == 0) {
            second = 1;
        }

        for (int i = 0; i <= first; i++) {
            for (int k = 0; k <= second; k++) {
                sum = a * i + b * k;
                if (sum == c) {
                    word = "Yes";
                    break;
                }
            }
            if (word.equals("Yes")) {
                break;
            }
        }
        if (!word.equals("Yes")) {
            for (int i = 0; i <= second; i++) {
                for (int k = 0; k <= first; k++) {
                    sum = b * i + a * k;
                    if (sum == c) {
                        word = "Yes";
                        break;
                    }
                }
                if (word.equals("Yes")) {
                    break;
                }
            }
        }

        System.out.println(word);

    }
}

import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.BufferedWriter;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author Roy
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        OutputWriter out = new OutputWriter(outputStream);
        AEbonyAndIvory solver = new AEbonyAndIvory();
        solver.solve(1, in, out);
        out.close();
    }

    static class AEbonyAndIvory {
        public void solve(int testNumber, InputReader in, OutputWriter out) {
            int a = in.readInteger();
            int b = in.readInteger();
            int c = in.readInteger();

            for (int i = 0; i <= 10000; i++) {
                for (int j = 0; j <= 10000; j++) {
                    if (a * i + b * j == c) {
                        out.printLine("Yes");
                        return;
                    }
                }
            }

            out.printLine("No");
        }

    }

    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;
        private InputReader.SpaceCharFilter filter;

        public InputReader(InputStream stream) {
            this.stream = stream;
        }

        public int read() {
            if (numChars == -1) {
                throw new InputMismatchException();
            }
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);

                } catch (IOException e) {
                    throw new InputMismatchException();
                }
                if (numChars <= 0) {
                    return -1;
                }
            }
            return buf[curChar++];
        }

        public int readInteger() {
            int c = read();
            while (isSpaceChar(c)) {
                c = read();
            }
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            int res = 0;
            do {
                if (c < '0' || c > '9') {
                    throw new InputMismatchException();
                }
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public boolean isSpaceChar(int c) {
            if (filter != null) {
                return filter.isSpaceChar(c);
            }
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        public interface SpaceCharFilter {
            public boolean isSpaceChar(int ch);

        }

    }

    static class OutputWriter {
        private final PrintWriter writer;

        public OutputWriter(OutputStream outputStream) {
            writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
        }

        public OutputWriter(Writer writer) {
            this.writer = new PrintWriter(writer);
        }

        public void print(Object... objects) {
            for (int i = 0; i < objects.length; i++) {
                if (i != 0) {
                    writer.print(' ');
                }
                writer.print(objects[i]);
            }
        }

        public void printLine(Object... objects) {
            this.print(objects);
            writer.println();
        }

        public void close() {
            writer.flush();
            writer.close();
        }

    }
}

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class A633 {
	public static void main (String[]args) throws IOException{
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st=new StringTokenizer(br.readLine());
		int a=Integer.parseInt(st.nextToken());
		int b=Integer.parseInt(st.nextToken());
		int c=Integer.parseInt(st.nextToken());
		boolean flag=false;
		for(int i=0;i<=c+1;i++){
			for(int j=0;j<=c+1;j++){
				if(a*i+b*j==c){
				flag=true;
			break;
				}
			}
			}
			if(flag)
				System.out.print("YES");
			else
				System.out.print("NO");
	}

}

import java.util.*  ;
public class ebonyandivory {

	public static void main(String[] args) {
		Scanner ss = new Scanner (System.in)  ;
		int a  = ss.nextInt() ;
		int b = ss.nextInt()  ;
		int c = ss.nextInt()  ;
		int t = 0 ; int f = 0 ;
		if (c==a || c== b){
			t=c ;
		}
		else{
		for (int x = 0;x<100; x++){
			t = 0 ;
			for(int y = 0 ;t<c ; y++){
				t= x*a+y*b ;
			}
			 if (t==c)
				 break ;

		}
		if (t!=c){
			for (int j = 0;j<100; j++){
				f = 0 ;
				for(int i = 0 ;f<c ; i++){
					f= i*a+j*b ;
				}
				 if (f==c)
					 break ;

			}
		}
		}
		if (t == c || f == c )
			System.out.println("YES");
		else
			System.out.println("NO");
	}

}

import java.util.Scanner;

public class Main{
    static Scanner in = new Scanner(System.in);
    public  static void main(String args[]){
        int x = in.nextInt();
        int y = in.nextInt();
        int z = in.nextInt();
        for (int i = 0; i < 100; i++) {
            for (int j = 0; j < 100; j++) {
                if((x*i) + (y*j) == z){
                    System.out.println("Yes");
                    return ;
                }
            }
        }
        System.out.println("No");
    }
}

import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.PrintWriter;

// this is not good for reading double values.
public class specialnumbers {
	public static void main(String[] args) throws IOException {
		Reader r = new Reader();
		PrintWriter o = new PrintWriter(System.out, false);
		int a = r.nextInt();
		int b = r.nextInt();
		int c = r.nextInt();
		boolean flag = false;
		for(int i=0;i<=c;i++){
			for(int j=0;j<=c;j++){
				if((i*a+j*b)==c){
					o.println("Yes");
					flag = true;
					break;
				}
			}
		}
		if(!flag){
			o.println("No");
		}
		o.close();
	}

	static class pair {
		int x, y;

		public pair(int x, int y) {
			// TODO Auto-generated constructor stub
			this.x = x;
			this.y = y;
		}
	}

	static int gcd(int n, int r) {
		return r == 0 ? n : gcd(r, n % r);
	}

	static long gcd(long n, long r) {
		return r == 0 ? n : gcd(r, n % r);
	}

	static class Reader {
		final private int BUFFER_SIZE = 1 << 16;
		private DataInputStream din;
		private byte[] buffer;
		private int bufferPointer, bytesRead;

		public Reader() {
			din = new DataInputStream(System.in);
			buffer = new byte[BUFFER_SIZE];
			bufferPointer = bytesRead = 0;
		}

		public Reader(String file_name) throws IOException {
			din = new DataInputStream(new FileInputStream(file_name));
			buffer = new byte[BUFFER_SIZE];
			bufferPointer = bytesRead = 0;
		}

		public final String readString() throws IOException {
			int c = read();
			while (isSpaceChar(c)) {
				c = read();
			}
			StringBuilder res = new StringBuilder();
			do {
				res.append((char) c);
				c = read();
			} while (!isSpaceChar(c));
			return res.toString();
		}

		private boolean isSpaceChar(int c) {
			return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
		}

		public int nextInt() throws IOException {
			int ret = 0;
			byte c = read();
			while (c <= ' ')
				c = read();
			boolean neg = (c == '-');
			if (neg)
				c = read();
			do {
				ret = ret * 10 + c - '0';
			} while ((c = read()) >= '0' && c <= '9');
			if (neg)
				return -ret;
			return ret;
		}

		public long nextLong() throws IOException {
			long ret = 0;
			byte c = read();
			while (c <= ' ')
				c = read();
			boolean neg = (c == '-');
			if (neg)
				c = read();
			do {
				ret = ret * 10 + c - '0';
			} while ((c = read()) >= '0' && c <= '9');
			if (neg)
				return -ret;
			return ret;
		}

		public double nextDouble() throws IOException {
			double ret = 0, div = 1;
			byte c = read();
			while (c <= ' ')
				c = read();
			boolean neg = (c == '-');
			if (neg)
				c = read();
			do {
				ret = ret * 10 + c - '0';
			} while ((c = read()) >= '0' && c <= '9');
			if (c == '.')
				while ((c = read()) >= '0' && c <= '9')
					ret += (c - '0') / (div *= 10);
			if (neg)
				return -ret;
			return ret;
		}

		public int[] readIntArray(int size) throws IOException {
			int[] arr = new int[size];
			for (int i = 0; i < size; i++)
				arr[i] = nextInt();
			return arr;
		}

		public long[] readLongArray(int size) throws IOException {
			long[] arr = new long[size];
			for (int i = 0; i < size; i++)
				arr[i] = nextInt();
			return arr;
		}

		private void fillBuffer() throws IOException {
			bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
			if (bytesRead == -1)
				buffer[0] = -1;
		}

		private byte read() throws IOException {
			if (bufferPointer == bytesRead)
				fillBuffer();
			return buffer[bufferPointer++];
		}

		public void close() throws IOException {
			if (din == null)
				return;
			din.close();
		}
	}
}

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.*;
import java.lang.*;

public class Submission {

    private static BufferedReader bi = new BufferedReader(new InputStreamReader(System.in));

    public static void main(String[] args){
        try{
            String[] nums = bi.readLine().split(" ");
            int ebonyDam = Integer.parseInt(nums[0]);
            int ivoryDam = Integer.parseInt(nums[1]);
            int shield = Integer.parseInt(nums[2]);
            if(shield == ebonyDam || shield == ivoryDam){
                System.out.println("Yes");
            } else{
                double y = 0.0;
                double x = 0.0;
                boolean shotsFired = true;
                while(y < shield && shotsFired){
                    x = (shield - (ivoryDam * y)) / ebonyDam;
                    if(x >= 0 && (int)x == x){
                        System.out.println("Yes");
                        shotsFired = false;
                    }
                    y++;
                }
                if(shotsFired){
                    System.out.println("No");
                }
            }
        }catch(Exception e){
            System.out.println(e.getMessage());
        }
    }

}

import java.util.*;
import java.lang.*;
import java.io.*;

public class Ideon
{
    public static void main(String[] args)
    {
      int a,b,c,d;
      Scanner in= new Scanner (System.in);
      a=in.nextInt();
      b=in.nextInt();
      c=in.nextInt();
      d=c;
      while(d>0)
              {
               if(d%a==0||d%b==0)
               {
                      System.out.println("Yes");
                   System.exit(0);

               }else
               {
                   d=d-a;
               }
              }
        while(c>0)
              {
               if(c%a==0||d%b==0)
               {
                   System.out.println("Yes");
                   System.exit(0);

               }else
               {
                   c=c-a;
               }
              }
               System.out.println("No");

    }
}

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int a= in.nextInt();
		int b= in.nextInt();
		int c= in.nextInt();
		for(int i=1;i<=100;i++){
			for(int j=1;j<=100;j++){
				if(i*a+j*b==c){
					System.out.println("Yes");
					return;
				}
			}
		}
		System.out.println("No");
	}

}

import java.io.ByteArrayInputStream;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

 public class Main{
public static void main(String args[]) throws IOException
{

      Reader r=new Reader ();

  int a=r.ni();
  int b=r.ni();
   int c=r.ni();
   Triple k=gcd(a,b);

   if(c%k.g!=0)
   {
    System.out.println("No");
   }
   else
   {
    k.x*=c/k.g;
    k.y*=c/k.g;
    System.out.println("Yes");
   }

}
static Triple gcd(int a,int b)
{
    if(b==0)
    {
      return new Triple(1,0,a);

    }

    Triple k=gcd(b,a%b);

    return new Triple(k.y,k.x-(a/b)*k.y,k.g);

}

static long pow(long a,long n,long s) {

  if(n==1)
  {
    return s;
  }
  if(n%2==0)
  {
    return pow(a,n/2,s*s);
  }
  else return pow(a,n/2,s*s*a);

    // if(n==0)
    // {
    //     return 1;
    // }

    // if(n%2==0)
    // {
    //     long k=pow(a,n/2);
    //     return k*k;
    // }
    // else {
    //     long k=pow(a,n/2);
    //     return a*k*k;
    // }
}

static long mul(long a,long b,long m)
{
if(a==1)
{
    return b%m;
}
  long k=mul(a/2,b,m);
  if(a%2==1)
  {
    return (k%m*2%m+b%m)%m;
  }
    else {
        return ( k%m*2)%m;
    }

}
}

 class Reader
{
    final private int BUFFER_SIZE = 1 << 16;
    private DataInputStream din;
    private byte[] buffer;
    private int bufferPointer, bytesRead;

    public Reader()
    {
        din = new DataInputStream(System.in);
        buffer = new byte[BUFFER_SIZE];
        bufferPointer = bytesRead = 0;
    }

    public Reader(String file_name) throws IOException
    {
        din = new DataInputStream(new FileInputStream(file_name));
        buffer = new byte[BUFFER_SIZE];
        bufferPointer = bytesRead = 0;
    }

    public String ns() throws IOException
    {
        byte[] buf = new byte[64]; // line length
        int cnt = 0, c;
        while ((c = read()) != -1)
        {
            if (c == '\n')
                break;
            buf[cnt++] = (byte) c;
        }
        return new String(buf, 0, cnt);
    }

    public int ni() throws IOException
    {
        int ret = 0;
        byte c = read();
        while (c <= ' ')
            c = read();
        boolean neg = (c == '-');
        if (neg)
            c = read();
        do
        {
            ret = ret * 10 + c - '0';
        }  while ((c = read()) >= '0' && c <= '9');

        if (neg)
            return -ret;
        return ret;
    }

    public long nl() throws IOException
    {
        long ret = 0;
        byte c = read();
        while (c <= ' ')
            c = read();
        boolean neg = (c == '-');
        if (neg)
            c = read();
        do {
            ret = ret * 10 + c - '0';
        }
        while ((c = read()) >= '0' && c <= '9');
        if (neg)
            return -ret;
        return ret;
    }

    public double nd() throws IOException
    {
        double ret = 0, div = 1;
        byte c = read();
        while (c <= ' ')
            c = read();
        boolean neg = (c == '-');
        if (neg)
            c = read();

        do {
            ret = ret * 10 + c - '0';
        }
        while ((c = read()) >= '0' && c <= '9');

        if (c == '.')
        {
            while ((c = read()) >= '0' && c <= '9')
            {
                ret += (c - '0') / (div *= 10);
            }
        }

        if (neg)
            return -ret;
        return ret;
    }

    private void fillBuffer() throws IOException
    {
        bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
        if (bytesRead == -1)
            buffer[0] = -1;
    }

    private byte read() throws IOException
    {
        if (bufferPointer == bytesRead)
            fillBuffer();
        return buffer[bufferPointer++];
    }

    public void close() throws IOException
    {
        if (din == null)
            return;
        din.close();
    }
}
class Triple{
    int x,y,g;
    Triple(int x,int y,int g)
    {
        this.x=x;
        this.y=y;
        this.g=g;
    }
}

import java.util.Scanner;

public class First {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		int a = sc.nextInt();
		int b = sc.nextInt();
		int t = sc.nextInt();

    for(int i=0;i<500;i++){
    	for(int j=0;j<500;j++){
        	if(a*i+b*j==t){
        		System.out.print("Yes");
        		return;
        	}
        }
    }
    System.out.print("No");
	}
}

import java.util.*;
import java.lang.*;
import java.math.*;
public class Main
{
	public static void main (String[] args) throws java.lang.Exception
	{
		Scanner in=new Scanner(System.in);int t=0,a=0,b=0,c=0;
    /* if(in.hasNext())
     t=in.nextInt();
     for(int j=0;j<t;j++)
     {*/
         if(in.hasNext())
         a=in.nextInt();
         if(in.hasNext())
         b=in.nextInt();
         if(in.hasNext())
         c=in.nextInt();
         boolean k=false;
         for(int i=0;i<=100;i++)
         {
             for(int j=0;j<=100;j++)
             {
                 if((a*i)+(b*j)==c)
                 {k=true;break;}
             }
         }
         /*BigInteger a1=new BigInteger(Integer.toString(a));
         BigInteger b1=new BigInteger(Integer.toString(b));
         BigInteger c1=new BigInteger(Integer.toString(c));
         BigInteger gcd1=a1.gcd(b1);*/
         //if(c1.mod(gcd1).equals(BigInteger.ZERO))
         if(k==true)
         {
         	System.out.println("Yes");
         }
         else
         System.out.println("No");
    // }

	}
}

import java.util.*;

import static java.lang.Math.*;

/* ===================================================================================
uva 10090 – Marbles – tutorial
17
SEP
We want to find m1 and m2 that satisfy the equation  n1 * m1 + n2 * m2 = n, and give us the minimum cost where cost = c1 * m1 + c2 * m2 .
Using extended Euclid to find gcd(n1,n2) and get m1`,m2` where n1 * m1` + n2 * m2` = gcd(n1,n2)
to get m1 and m2 multiply both sides by n/gcd m1`=m1`*n/gcd , m2`=m2`*n/gcd.
Now m1 = m1 + n2 / g * t  , m2 = m2 –  n1 / g * t   any integer t satisfy the desired equation, but we want to minimize the cost  c = c1 * m1 + c2 * m2 = c1 * ( m1 + n2 / g * t )  +   c2 * ( m2 – n1 /g * t) = c1*m1 +c2*m2 + t * (c1* n2/g – c2 *n1/g).
Since c1*m1 +c2*m2  is constant we want to minimize  t * (c1* n2/g – c2 *n1/g)
How to get t ?
As we mention above m1 = m1 + n2 / g * t  , m2 = m2 –  n1 / g * t , m1 && m2 >=0
So m1 + n2 / g * t >=0 ,  n2 / g * t >= – m1 ,  t >= – m1 *g / n2
Also m2 –  n1 / g * t>=0  ,  – n1 / g * t >= – m2 , t <= m2 * g / n1
so ceil(-m1*g/n2) <= t <= floor(m2*g/n1),
Now  just check the two boundaries, and choose the one that give you the cheaper cost.
========================================================================================*/

public class Main {
    static int x, y, g,minxx,minyy;

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
//        int t=sc.nextInt();
//        for (int i=1;i<=t;i++){

            int a = sc.nextInt();
            int b = sc.nextInt();
            int c = sc.nextInt();
            boolean solve=solve(a, b, c);
            if (!solve) {
                System.out.printf("No");
                System.out.println();

            } else {
                System.out.printf("Yes");
                System.out.println();
            }
//        }

    }

    static int gcd(int a, int b) {
        if (a == 0) {
            x = 0;
            y = 1;
            return b;
        }
        g = gcd(b % a, a);
        int x1 = y - (b / a) * x;
        int y1 = x;
        x = x1;
        y = y1;
        return g;
    }

        static boolean solve(int a,int b,int c){
        long gcd=gcd(a,b);
        if (c%gcd!=0){
            return false;
        }
        x*=(c/gcd);
        y*=(c/gcd);

        return true;

    }
}

import javax.swing.*;
import java.io.*;
import java.math.*;
import java.util.*;

// author @mdazmat9
public class codeforces{
    public static void main(String[] args) throws IOException {
        Scanner sc = new Scanner(System.in);
        PrintWriter out = new PrintWriter(System.out);
        int test = 1;
        for (int ind = 0; ind < test; ind++) {
            int a = sc.nextInt();
            int b = sc.nextInt();
            int c = sc.nextInt();
            int ans = -1;
            for (int i = 0; i <= c; i++) {

                int t = c - (b * i);
                if(t<0){
                    break;
                }
                out.println(t);
                if (t % a == 0) {
                    ans = 1;
                    break;
                }
            }
            if(ans==1){
                out.println("Yes");
            }
            else{
                out.println("No");
            }
        }
        out.flush();

    }

    static   void shuffle(int[] a) {
        int n = a.length;
        for(int i = 0; i < n; i++) {
            int r = i + (int) (Math.random() * (n - i));
            int tmp = a[i];
            a[i] = a[r];
            a[r] = tmp;
        }
    }
    static long gcd(long a , long b)
    {
        if(b == 0)
            return a;
        return gcd(b , a % b);
    }

}
class Scanner {
    public BufferedReader reader;
    public StringTokenizer st;

    public Scanner(InputStream stream) {
        reader = new BufferedReader(new InputStreamReader(stream));
        st = null;
    }

    public 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();
    }

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

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

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

class OutputWriter {
    BufferedWriter writer;

    public OutputWriter(OutputStream stream) {
        writer = new BufferedWriter(new OutputStreamWriter(stream));
    }

    public void print(int i) throws IOException {
        writer.write(i);
    }

    public void print(String s) throws IOException {
        writer.write(s);
    }

    public void print(char[] c) throws IOException {
        writer.write(c);
    }

    public void close() throws IOException {
        writer.close();
    }

}

import java.util.Scanner;

public class IvoryEbony {

	public static void main(String[] args) {
		Scanner input = new Scanner(System.in);
		int x = input.nextInt();
		int y = input.nextInt();
		int target = input.nextInt();
		boolean divisible = false;
		if(x % target == 0 || y % target == 0 || target == 0){
			System.out.println("Yes");
			divisible = true;
		}else{
			if(factorsDivide(x, y, target)){
				System.out.println("Yes");
			}else{
				System.out.println("No");
			}
		}

	}
	public static boolean factorsDivide(int x, int y, int t){
		for(int i = x; i < t; i+=x){
			if(i % y == 0 && i > y){
				return true;
			}
		}
		return false;
	}

}

import java.util.*;
import java.lang.*;
public class acm {

	public static void main(String[] args) {
	    Scanner sc = new Scanner(System.in);
		double a = sc.nextInt();double b = sc.nextInt();double c = sc.nextInt();
		boolean flag=false;double n;double m=0;
		n= (c-m*b)/a;

		while(m<c && flag!=true){
			n= (c-m*b)/a;

			if(((int)n)==n)
				flag=true;
			else
				m++;

		}
		if(flag && ((n*a)+(m*b))==c)
			System.out.println("YES");
		else
			System.out.println("NO");

	   }}

import java.util.Scanner;

/**
 *
 * @author AdminHP-262
 */
public class EbonyandIvory {

    public static void main(String[] args) throws Exception {
        Scanner scanner = new Scanner(System.in);

        int a = scanner.nextInt();
        int b = scanner.nextInt();
        int c = scanner.nextInt();

        if (c % a == 0 || c % b == 0) {
            System.out.println("Yes");
        } else {
            if (a > c && b > c) {
                System.out.println("No");
                return;
            }
            int temp = 0;
            while (temp <= c) {
                temp += b;
                if ((((c - temp) / a) + a % a) == 0) {
                    System.out.println("Yes");
                    return;
                }
            }
            System.out.println("No");
        }
    }
}

import java.io.*;
import java.util.*;

public class First {
    private static final Scanner sc = new Scanner(System.in);
    private static final PrintWriter pw = new PrintWriter(System.out);
    private static StringBuffer ans = new StringBuffer();

    public static void main(String[] args) throws Exception {
        int a = sc.nextInt(), b = sc.nextInt(), c = sc.nextInt();
        int[] x = gcd(a, b);
        if (c % x[0] != 0) ans.append("No");
        else {
            x[1] *= (c / x[0]);
            x[2] *= (c / x[0]);
            if (x[1] == 0 || x[2] == 0) ans.append("Yes");
            else if (x[1] % x[2] == 0) ans.append("Yes");
            else ans.append("No");
        }
        pw.print(ans);
        sc.close();
        pw.close();
    }

    private static int[] gcd(int a, int b) {
        if (b == 0) return new int[]{a, 1, 0};
        int[] ans = gcd(b, a % b);
        return new int[]{ans[0], ans[2], ans[1] - (a / b) * ans[2]};
    }
}

class Scanner {
    private final BufferedReader br;
    private StringTokenizer st;

    public Scanner(InputStream in) {
        br = new BufferedReader(new InputStreamReader(in));
        st = new StringTokenizer("");
    }

    public String next() throws IOException {
        if (!st.hasMoreTokens())
            st = new StringTokenizer(br.readLine());
        return st.nextToken();
    }

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

    public void close() throws IOException {
        br.close();
    }
}

class PrintWriter {
    private final BufferedOutputStream pw;

    public PrintWriter(OutputStream out) {
        pw = new BufferedOutputStream(out);
    }

    public void print(Object o) throws IOException {
        pw.write(o.toString().trim().getBytes());
        pw.flush();
    }

    public void close() throws IOException {
        pw.close();
    }
}

import java.util.Scanner;

public class EbonyAndIvory{

	public static void main(String[] args){

		Scanner kbd = new Scanner(System.in);

		int ebony = kbd.nextInt();
		int ivory = kbd.nextInt();
		int totalDamage = kbd.nextInt();

		int damageE;
		int damageI;
		boolean defeat = false;

		Outer:
		for(int x=0; x != totalDamage; x++){
			damageE = ebony*x;
			if(damageE == totalDamage){
				System.out.print("Yes");
				defeat = true;
				break Outer;
			}
			for(int y=0; y <= totalDamage; y++){
				damageI = ivory*y;
				if(damageE + damageI == totalDamage){
					System.out.print("Yes");
					defeat = true;
					break Outer;
				}
			}
		}
		if(defeat == false)
			System.out.print("No");
	}
}

import java.util.Scanner;

public class Lololols {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner scan = new Scanner(System.in);
		int bl = scan.nextInt();
		int w = scan.nextInt();
		int ex = scan.nextInt();
		if (w > ex && bl > ex) {
			System.out.println("No");
		} else {

			if (w == ex || bl == ex || ex % bl == 0 || w % bl == 0) {
				System.out.println("Yes");
			} else {

				boolean t = false;
				for (int i = ex; i - bl > 0; i = i - bl) {
					if (i % w == 0) {
						t = true;
					}
				}
				for (int i = ex; i - w > 0; i = i - w) {
					if (i % bl == 0) {
						t = true;
					}
				}
				if (t) {
					System.out.println("Yes");
				} else {
					System.out.println("No");
				}
			}
		}
	}

}

import java.util.Scanner;
public class OmAhmedSabry {

    public static void main(String[] args) {

        Scanner input = new Scanner (System.in);

        int A = input.nextInt();
        int B = input.nextInt();
        int C = input.nextInt();

        if(A%2==0 && B%2==0){
            System.out.println("Yes");
        }
        else System.out.println("No");

    }

}

import java.util.Scanner;

public class First {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		int a = sc.nextInt();
		int b = sc.nextInt();
		int t = sc.nextInt();

    for(int i=0;i<500;i++){
    	for(int j=0;j<500;j++){
        	if(a*i + b*j==t){
        		System.out.print("Yes");
        		return;
        	}
        }
    }
    System.out.print("No");
	}
}

import java.io.IOException;
import java.util.*;

public class Main {

	public static void main(String[] args) throws NumberFormatException, IOException {
		Scanner scn = new Scanner(System.in);
		int a = scn.nextInt();
		int b = scn.nextInt();
		int c = scn.nextInt();

		if (find_any_solution(a, b, c)) {
			System.out.println("Yes");
		} else {
			System.out.println("No");
		}
	}

	static int x, y, g;

	public static boolean find_any_solution(int a, int b, int c) {
		g = extendedeuclid(a, b);
		if (c % g != 0) {
			return false;
		}
		if (x < 0) {
			return false;
		}
		return true;
	}

	public static int extendedeuclid(int a, int b) {
		if (a == 0) {
			x = 0;
			y = 1;
			return b;
		}

		int x1;
		int y1;
		int gcd = extendedeuclid(b % a, a);

		x1 = x;
		y1 = y;

		x = y1 - (b / a) * x1;
		y = x1;
		return gcd;
	}
}

import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

public final class Main
{
	static long mod = 998244353l;
	static Map<Long, Long> invk = new HashMap<>();
	static int f[];
	static int fmin = 0;

	public static void main(String[] args) throws IOException
	{
		Scanner in = getScan(args);
		// int tt = in.nextInt();
		// while (tt-- > 0)
		// {
		int a = in.nextInt();
		int b = in.nextInt();
		int c = in.nextInt();

		boolean res = false;
		while (c > 0)
		{
			if (c % a != 0)
			{
				c -= b;
			}
			else
			{
				res = true;
				break;
			}
		}
		System.out.println(res ? "YES" : "NO");
		// }
	}

	public static long gcd(long a, long b)
	{
		if (a == 0 || b == 0)
		{
			return a | b;
		}
		int shift = Long.numberOfTrailingZeros(a | b);
		a = a >> Long.numberOfTrailingZeros(a);
		while (b > 0)
		{
			b = b >> Long.numberOfTrailingZeros(b);
			if (a > b)
			{
				long tmp = a;
				a = b;
				b = tmp;
			}
			b -= a;
		}
		return a << shift;
	}

	public static int find(Subset[] subset, int i)
	{
		if (subset[i].parent != i)
		{
			subset[i].parent = find(subset, subset[i].parent);
		}
		return subset[i].parent;
	}

	public static void union(Subset[] subset, int x, int y)
	{
		int rootx = find(subset, x);
		int rooty = find(subset, y);
		if (subset[rootx].rank < subset[rooty].rank)
		{
			subset[rootx].parent = rooty;
		}
		else if (subset[rootx].rank > subset[rooty].rank)
		{
			subset[rooty].parent = rootx;
		}
		else
		{
			subset[rootx].parent = rooty;
			subset[rooty].rank++;
		}
	}

	static class Subset
	{
		int parent;
		int rank;
	}

	public static long fact(int n)
	{
		if (n <= fmin)
		{
			return f[n];
		}
		long res = f[fmin];
		for (int i = fmin + 1; i <= n; i++)
		{
			res = (res * i) % mod;
			f[i] = (int) res;
		}
		fmin = n;
		return res;
	}

	public static int log2nlz(int bits)
	{
		if (bits == 0) return 0; // or throw exception
		return 31 - Integer.numberOfLeadingZeros(bits);
	}

	static Scanner getScan(String[] args) throws IOException
	{
		if (args.length == 0)
		{
			return new Scanner(System.in);
		}
		else
		{
			return new Scanner(new File(args[0]));
		}
	}

	static BufferedReader getBuffer(String[] args) throws IOException
	{
		if (args.length == 0)
		{
			return new BufferedReader(new InputStreamReader(System.in));
		}
		else
		{
			return new BufferedReader(new FileReader(args[0]));
		}
	}

	public static long binpowMod(long x, long y, long mod)
	{
		long z = 1;
		x = x % mod;
		while (y > 0)
		{
			if (y % 2 == 1)
			{
				z = (z * x) % mod;
				y--;
			}
			else
			{
				x = (x * x) % mod;
				y = y >> 1;
			}
		}
		return z;
	}

	public static long invMod(long x, long mod)
	{
		if (!invk.containsKey(x))
		{
			invk.put(x, binpowMod(x, mod - 2, mod));
		}
		return invk.get(x);
	}

	public static long divMod(long x, long y, long mod)
	{
		x = x % mod;
		y = y % mod;
		return (x * invMod(y, mod)) % mod;
	}
}

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.*;
import java.lang.*;

public class Submission {

    private static BufferedReader bi = new BufferedReader(new InputStreamReader(System.in));

    public static void main(String[] args){
        try{
            String[] nums = bi.readLine().split(" ");
            int ebonyDam = Integer.parseInt(nums[0]);
            int ivoryDam = Integer.parseInt(nums[1]);
            int shield = Integer.parseInt(nums[2]);
            if(shield == ebonyDam || shield == ivoryDam){
                System.out.println("Yes");
            } else{
                double y = 0.0;
                double x = 0.0;
                boolean shotsFired = true;
                while(y < shield && shotsFired){
                    x = (shield - (ivoryDam * y)) / ebonyDam;
                    System.out.println(x + " + " + y);
                    if(x > 0 && (int)x == x){
                        System.out.println("Yes");
                        shotsFired = false;
                    }
                    y++;
                }
                if(shotsFired){
                    System.out.println("No");
                }
            }
        }catch(Exception e){
            System.out.println(e.getMessage());
        }
    }
}

import java.util.Scanner;
public class Ebony_and_Ivory {

	public static void main(String[] args) {
		Scanner kbd= new Scanner(System.in);
		int ebony =kbd.nextInt();
		int ivory = kbd.nextInt();
		int shield = kbd.nextInt();

		if(shield%ebony==0||shield%ivory==0)	{
			System.out.println("Yes");
			System.exit(0);
		}
		for(int temp=shield;temp>0;temp--)
		{
		int temp1=temp;
			if(temp%ebony==0 )
			{
				while(temp1<=shield)
				{
					temp1=temp1+ivory;
					if(temp1==shield)
					{
						System.out.println("Yes");
						System.exit(0);
					}
					else
					{
						System.out.println("No");
						System.exit(0);
					}
				}
			}
			else if(temp%ivory==0)
			{
				while(temp1<=shield)
				{
					temp1=temp1+ebony;
					if(temp1==shield)
					{
						System.out.println("Yes");
						System.exit(0);
					}
					else
					{
						System.out.println("No");
						System.exit(0);
					}

				}
			}
		}

		kbd.close();
		}
	}

import java.util.Scanner;

public class EbonyAndIvory {
    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);

        int ebonyDamage = input.nextInt();
        int ivoryDamage = input.nextInt();
        int shieldHealth = input.nextInt();

        if(shieldHealth%ebonyDamage==0 || shieldHealth%ivoryDamage==0){
        	System.out.println("Yes");
        }else{
        	while(shieldHealth!=ebonyDamage || shieldHealth!=ivoryDamage || shieldHealth>(ivoryDamage+ebonyDamage)){
        		shieldHealth = shieldHealth-(ebonyDamage+ivoryDamage);
        		if((shieldHealth%ebonyDamage==0 && shieldHealth>=0) || (shieldHealth%ivoryDamage==0 && shieldHealth>=0)){
        			System.out.println("Yes");
        			break;
        		}else{
        			System.out.println("No");
        			break;
        		}
        	}
        }
    }
}

import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.PrintWriter;

// this is not good for reading double values.
public class specialnumbers {
	public static void main(String[] args) throws IOException {
		Reader r = new Reader();
		PrintWriter o = new PrintWriter(System.out, false);
		int a = r.nextInt();
		int b = r.nextInt();
		int c = r.nextInt();
		boolean flag = false;
		for(int i=0;i<=c;i++){
			for(int j=0;j<=c;j++){
				if((a*i+b*j)==c){
					o.println("Yes");
					flag = true;
					break;
				}
			}
		}
		if(!flag){
			o.println("No");
		}
		o.close();
	}

	static class pair {
		int x, y;

		public pair(int x, int y) {
			// TODO Auto-generated constructor stub
			this.x = x;
			this.y = y;
		}
	}

	static int gcd(int n, int r) {
		return r == 0 ? n : gcd(r, n % r);
	}

	static long gcd(long n, long r) {
		return r == 0 ? n : gcd(r, n % r);
	}

	static class Reader {
		final private int BUFFER_SIZE = 1 << 16;
		private DataInputStream din;
		private byte[] buffer;
		private int bufferPointer, bytesRead;

		public Reader() {
			din = new DataInputStream(System.in);
			buffer = new byte[BUFFER_SIZE];
			bufferPointer = bytesRead = 0;
		}

		public Reader(String file_name) throws IOException {
			din = new DataInputStream(new FileInputStream(file_name));
			buffer = new byte[BUFFER_SIZE];
			bufferPointer = bytesRead = 0;
		}

		public final String readString() throws IOException {
			int c = read();
			while (isSpaceChar(c)) {
				c = read();
			}
			StringBuilder res = new StringBuilder();
			do {
				res.append((char) c);
				c = read();
			} while (!isSpaceChar(c));
			return res.toString();
		}

		private boolean isSpaceChar(int c) {
			return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
		}

		public int nextInt() throws IOException {
			int ret = 0;
			byte c = read();
			while (c <= ' ')
				c = read();
			boolean neg = (c == '-');
			if (neg)
				c = read();
			do {
				ret = ret * 10 + c - '0';
			} while ((c = read()) >= '0' && c <= '9');
			if (neg)
				return -ret;
			return ret;
		}

		public long nextLong() throws IOException {
			long ret = 0;
			byte c = read();
			while (c <= ' ')
				c = read();
			boolean neg = (c == '-');
			if (neg)
				c = read();
			do {
				ret = ret * 10 + c - '0';
			} while ((c = read()) >= '0' && c <= '9');
			if (neg)
				return -ret;
			return ret;
		}

		public double nextDouble() throws IOException {
			double ret = 0, div = 1;
			byte c = read();
			while (c <= ' ')
				c = read();
			boolean neg = (c == '-');
			if (neg)
				c = read();
			do {
				ret = ret * 10 + c - '0';
			} while ((c = read()) >= '0' && c <= '9');
			if (c == '.')
				while ((c = read()) >= '0' && c <= '9')
					ret += (c - '0') / (div *= 10);
			if (neg)
				return -ret;
			return ret;
		}

		public int[] readIntArray(int size) throws IOException {
			int[] arr = new int[size];
			for (int i = 0; i < size; i++)
				arr[i] = nextInt();
			return arr;
		}

		public long[] readLongArray(int size) throws IOException {
			long[] arr = new long[size];
			for (int i = 0; i < size; i++)
				arr[i] = nextInt();
			return arr;
		}

		private void fillBuffer() throws IOException {
			bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
			if (bytesRead == -1)
				buffer[0] = -1;
		}

		private byte read() throws IOException {
			if (bufferPointer == bytesRead)
				fillBuffer();
			return buffer[bufferPointer++];
		}

		public void close() throws IOException {
			if (din == null)
				return;
			din.close();
		}
	}
}

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class contest {

	public static void main(String[] args)throws NumberFormatException,IOException {
	          BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
	          StringTokenizer st = new StringTokenizer(bf.readLine());
	          int a = Integer.parseInt(st.nextToken());
	          int b = Integer.parseInt(st.nextToken());
	          int c = Integer.parseInt(st.nextToken());
	          int at = c / a;
	          int bt = c / b;
	          boolean is = false;
	       //   System.out.println(at);
	         // System.out.println(bt);
	          for (int i = 0; i <= at ; i++) {
				 for (int j = 0; j <= bt; j++) {
					if( (a*i)+(b*j) == c){
						System.out.println("Yes");
						is = true;
						break;
			}
					    if(is)
					    	break;
			}
	          }
	          if(!is)
	        	  System.out.println("No");

	}

}

import java.util.Scanner;

public class EbonyandIvory {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(System.in);
		int a = sc.nextInt();
		int b = sc.nextInt();
		int c = sc.nextInt();
		for (int x = 0; a * x <= c; x++) {
			if (c - ((a * x) + b) == 0) {
				System.out.println("Yes");
				return;
			}
		}
		System.out.println("No");
	}

}

import java.io.*;
import java.util.*;
public class EbonyAndIvory
{
    public static void main(String args[])
    {
        Scanner sc=new Scanner(System.in);
        int a=sc.nextInt();
        int b=sc.nextInt();
        int c=sc.nextInt();
        if(c<Math.min(a,b))
            System.out.println("No");
        else if(c%a==0 || c%b==0)
            System.out.println("Yes");
        else if((c-a)%b==0 || ((c-b)%a==0))
            System.out.println("Yes");
        else
            System.out.println("No");
    }
}

import java.util.*;

public class EbonyIvory {

	static Scanner sc = new Scanner(System.in);
	static int a, b, c, x, y, d;

	public static int gcd(int a, int b) {
		return b == 0 ? a : gcd(b, a % b);
	}

	public static void main(String[] args) {
		a = sc.nextInt();
		b = sc.nextInt();
		c = sc.nextInt();

		if (c < a && c < b)
			System.out.println("NO");
		else {
			d = gcd(a, b);
			System.out.println(c%d==0?"YES":"NO");
		}

	}
}

import java.util.Scanner;

public class EbonyandEvory {

	public static void main(String[] args) {
		// TODO Auto-generated method stub

		Scanner input = new Scanner(System.in);
		int a = input.nextInt();
		int b = input.nextInt();
		int c = input.nextInt();
		if(c%gcd(a,b)==0)System.out.println("Yes");
		else
			System.out.println("No");

	}

	private static int gcd(int a, int b){
		if(b==0)return a;
		else
			return gcd(b,a%b);

	}

}

import java.util.*;
import java.lang.*;

public class Main
{
	public static  long gcd(long a ,long b)
	{
		if(b==0)
			return a;
		else{
			return gcd(b,a%b);
		}
	}
	public static void main (String[] args) throws java.lang.Exception
	{
		Scanner sc=new Scanner(System.in);

			long a =sc.nextLong();
			long b =sc.nextLong();
			long c =sc.nextLong();
			if(c%a==0 || c%b==0)
			{
				System.out.println("Yes");
			}
			else{
			long g=gcd(a,b);
			if(c%g==0)
				System.out.println("Yes");
			else
				System.out.println("No");
}

	}
}

import java.util.Scanner;

public class ProblemA {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int a = sc.nextInt();
		int b = sc.nextInt();
		int c = sc.nextInt();
		sc.close();
		for (int i = 0; i < b && a * i < c; i++) {
			if ((c - a * i) % b == 0) {
				System.out.println("Yes");
				return;
			}
		}
		System.out.println("No");
		sc.close();
	}
}

import java.util.Scanner;

public class Task01 {

public static void main(String[] args) {
	Scanner input = new Scanner(System.in);
	long a = input.nextLong();
	long b = input.nextLong();
	long c = input.nextLong();
	long x,y;
	String rez="No";
	for (long i=1; i<=c; i++){
		x=i;
		if (a*x>c||b>c){break;}
		y=(c-a*x)%b;
		if (y==0){
			rez="Yes";
			break;
		}
	}

	System.out.print(rez);
	}
}

import java.util.*;

public class Main {

    public static void main(String[] args) {

        Scanner sc=new Scanner(System.in);
        int a=sc.nextInt();
        int b=sc.nextInt();
        int c=sc.nextInt();
        String f="No";
        if (a>b) {a=a+b; b=a-b; a=a-b;}
        for (int i = 1; i < c; i++) {
            if (c>=a*i||(c>=a*i &&(c -a*i)%b ==0)) {
                f="Yes"; break;
            }
        }
        for (int i = 1; i < c; i++) {
            if (c>=b*i||(c>=b*i &&(c -b*i)%a ==0)) {
                f="Yes"; break;
            }
        }

        System.out.println(f);

    }

}

import java.util.*;
public class InDaClub {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int a = sc.nextInt();
		int b = sc.nextInt();
		int c = sc.nextInt();
		sc.close();
		boolean f = true;
		if (a != c && b != c && c%a != 0 && c%b != 0) {
			for (int i = c-1; i > 1 && f; i--) {
				if (c%i == 0) {
					if (i%a == 0 ||  i%b == 0)
						i = c/i+1;
					else
						f = false;
				}
			}

		}
		System.out.println(f?"Yes":"No");
	}

}

import java.util.*;
public class Solution{
	public static void main(String args[]){
		Scanner in=new Scanner(System.in);
		int a=in.nextInt();
		int b=in.nextInt();
		int c=in.nextInt();
		int i=0;
		for(i=1;i*a<c;i++){
			for(int j=1;j*b<c;j++){
				if((a*i+b*j)==c)
				{System.out.println("Yes");i=c;break;}
			}
		}
		if(i!=c)
			System.out.println("No");
	}
}

import java.util.*;
import java.io.*;
import java.lang.*;

public class A633 {

  public static void main(String[] args) {

    int gun1, gun2, needed;
    boolean possible = false;

    Scanner s = new Scanner(System.in);
    gun1 = s.nextInt();
    gun2 = s.nextInt();
    needed = s.nextInt();

    if(needed % gun1 == 0) possible = true;
    if(needed % gun2 == 0) possible = true;

    if(!possible && gun1 > gun2) {
      int change = needed / gun1;
      needed -= gun1*change;
      for(int i=0; i< change && !possible; i++){
        needed += gun1*(gun1-gun2);
        if(needed % gun2 == 0)
          possible = true;
      }
    }
    else if(!possible && gun2 > gun1) {
      int change = needed / gun2;
      needed -= gun2*change;
      for(int i=0; i< change && !possible; i++){
        needed += gun2*(gun2-gun1);
        if(needed % gun1 == 0)
          possible = true;
      }
    }

    if (possible)
      System.out.println("YES");
    else
      System.out.println("NO");
  }
}

import java.util.Scanner;

/**
 *
 * @author AdminHP-262
 */
public class EbonyandIvory {

    public static void main(String[] args) throws Exception {
        Scanner scanner = new Scanner(System.in);

        int a = scanner.nextInt();
        int b = scanner.nextInt();
        int c = scanner.nextInt();
        if (c % a == 0 || c % b == 0) {
            System.out.println("Yes");
        } else {
            if (a > c && b > c) {
                System.out.println("No");
                return;
            }
            if (a > c) {
                if (c % b == 0) {
                    System.out.println("Yes");
                } else {
                    System.out.println("No");
                }
                return;
            } else if (b > c) {
                if (c % a == 0) {
                    System.out.println("Yes");
                } else {
                    System.out.println("No");
                }
                return;
            }
            int temp1 = c - a;
            int temp2 = c - b;
            if (temp1 % b == 0 || temp2 % a == 0) {
                System.out.println("Yes");
            } else {
                System.out.println("No");
            }
        }
    }
}

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.StringTokenizer;

public class fam {

    public static void main(String[] args) throws IOException, InterruptedException {
        FastScanner in = new FastScanner(System.in);
        PrintWriter writer = new PrintWriter(System.out);
     //   StringBuilder sb = new StringBuilder("");

        int a=in.nextInt();
        int b=in.nextInt();
        int c=in.nextInt();
        int max = Math.max(a, b);
        int min = Math.min(a, b);
        int ans =0;
        for(int i = 0;i<10000;i++)
        {
        	ans = c - min*i;
        	if(ans >= 0 && ans%max ==0)
        	{	writer.print("Yes");
        	    System.exit(0);
            }
        }
        writer.println("No");
        writer.close();
        in.close();
    }
}

class FastScanner {

    BufferedReader reader;
    StringTokenizer tokenizer;

    public FastScanner(InputStream stream) {
        this.reader = new BufferedReader(new InputStreamReader(stream));
    }

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

    public int[] nextIntegerArray(int n) throws IOException {
        int[] a = new int[n];
        for (int i = 0; i < a.length; i++) {
            a[i] = nextInt();
        }
        return a;
    }

    public long[] nextLongArray(int n) throws IOException {
        long[] a = new long[n];
        for (int i = 0; i < a.length; i++) {
            a[i] = nextLong();
        }
        return a;
    }

    public int nextInt(int radix) throws IOException {
        return Integer.parseInt(next(), radix);
    }

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

    public long nextLong(int radix) throws IOException {
        return Long.parseLong(next(), radix);
    }

    public double nextDouble() throws IOException {
        return Double.parseDouble(next());
    }

    public BigInteger nextBigInteger() throws IOException {
        return new BigInteger(next());
    }

    public BigInteger nextBigInteger(int radix) throws IOException {
        return new BigInteger(next(), radix);
    }

    public String next() throws IOException {
        if (tokenizer == null || !tokenizer.hasMoreTokens()) {
            tokenizer = new StringTokenizer(reader.readLine());
            return this.next();
        }
        return tokenizer.nextToken();
    }

    public void close() throws IOException {
        this.reader.close();
    }
}

import java.util.*;
public class Damage {
public static void main (String[]args){
	Scanner sc = new Scanner (System.in);
	int a = sc.nextInt();
	int b = sc.nextInt();
	int c = sc.nextInt();
	boolean g = false;
	for (int n = 1 ; n<=c ; n++){
		for (int m = 1; m<=c;m++)
			if (n*a+m*b==c){
				System.out.println("Yes");
				g = true;
				break;}}
	if (!g)System.out.println("No");
}

}

import java.util.Scanner;
public class Main {

    public static void main(String[] args) {int a,b,c;
        Scanner s= new Scanner(System.in);
        a=s.nextInt();
        b=s.nextInt();
        c=s.nextInt();
        if(c==a || c==b) System.out.println("Yes");
        else
            if(a+b==c) System.out.println("Yes");
        else
        if (c-(a+b)==a || c-(a+b)==b) System.out.println("Yes");
        else
            System.out.println("No");

    }

}

import java.io.IOException;
import java.util.Scanner;

public class g {

	 public static  void main(String [] args) throws  IOException{
		// BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
		 Scanner sc=new Scanner(System.in);

	int a=sc.nextInt();
	int b=sc.nextInt();
	int c=sc.nextInt();

  boolean flag=false;
    for(int i=0;i< c/a+2;i++)
    {
        for(int j=0;j<c/b+2;j++)
        {
            if(i*a+j*b==c)
            {
                System.out.print("Yes");
                flag=true;

            }
        }
    }

	 }
	 }

import java.util.Scanner;

public class Lololols {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner scan = new Scanner(System.in);
		int bl = scan.nextInt();
		int w = scan.nextInt();
		int ex = scan.nextInt();
		if(w > ex && bl > ex){
			System.out.println("No");
		}
		if(w == ex || bl == ex || ex % bl == 0 ||w % bl == 0){
			System.out.println("Yes");
		}
		boolean t = false;
		for(int i = ex; i > 0;i -= bl){
			if (i % w == 0) {
				t = true;
			}
		}
		if (t) {
			System.out.println("Yes");
		}else {
			System.out.println("No");
		}
	}

}

import java.io.IOException;
import java.util.*;

public class Main {

	public static void main(String[] args) throws NumberFormatException, IOException {
		Scanner scn = new Scanner(System.in);
		int a = scn.nextInt();
		int b = scn.nextInt();
		int c = scn.nextInt();

		if (find_any_solution(a, b, c)) {
			System.out.println("Yes");
		} else {
			System.out.println("No");
		}
	}

	static int  g;

	public static boolean find_any_solution(int a, int b, int c) {
		g = extendedeuclid(Math.abs(a), Math.abs(b));
		if (c % g != 0) {
			return false;
		}
		return true;
	}

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

		int gcd = extendedeuclid(b%a, a);

		return gcd;
	}
}

import java.util.*;
import java.lang.*;
import java.math.*;
public class Main
{
	public static void main (String[] args) throws java.lang.Exception
	{
		Scanner in=new Scanner(System.in);int t=0,a=0,b=0,c=0;
    /* if(in.hasNext())
     t=in.nextInt();
     for(int j=0;j<t;j++)
     {*/
         if(in.hasNext())
         a=in.nextInt();
         if(in.hasNext())
         b=in.nextInt();
         if(in.hasNext())
         c=in.nextInt();
         boolean k=false;
         for(int i=0;i<=100;i++)
         {
             for(int j=0;j<=100;j++)
             {
                 if((a*i)+(b*j)==c)
                 {k=true;break;}
             }
         }
         /*BigInteger a1=new BigInteger(Integer.toString(a));
         BigInteger b1=new BigInteger(Integer.toString(b));
         BigInteger c1=new BigInteger(Integer.toString(c));
         BigInteger gcd1=a1.gcd(b1);*/
         //if(c1.mod(gcd1).equals(BigInteger.ZERO))
         if(k==true)
         {
         	System.out.println("Yes");
         }
         else
         System.out.println("No");
    // }

	}
}

import java.util.*;

public class Cc {

	public static void main(String[] args) {
		Scanner clavier=new Scanner(System.in);
		int a=clavier.nextInt();
		int b=clavier.nextInt();
		int c=clavier.nextInt();
		//int t=0;
		int y=0;
		for(int i=0;i<=c;i++)
		{for(int k=0;k<=c;k++)
			{if((a*k)+(b*i)==c)
				{y=1;
				System.out.println("YES");
				break;}
				if(y==1)
					{break;}}
		     }
		if(y!=1)
			System.out.println("NO");

	}

}

import java.util.*  ;
public class ebonyandivory {

	public static void main(String[] args) {
		Scanner ss = new Scanner (System.in)  ;
		int a  = ss.nextInt() ;
		int b = ss.nextInt()  ;
		int c = ss.nextInt()  ;
		int t = 0 ;
		int f=0 ;
		if (c==a || c== b){
			t= c ;
		}
		else{
		for (int x = 0;t<c; x++){
			for(int y = 0 ;t<c ; y++){
				t= x*a+y*b ;

			}
		}
		if (t!=c){
		for (int j = 0;f<c; j++){
			for(int k = 0 ;f<c ; k++){
				f = k*a+j*b ;
			}
		}
		}}
		if (t == c || f == c)
			System.out.println("YES");
		else
			System.out.println("NO");
	}

}

import java.util.*;
public class la6 {
	public static void main (String[]args){
	Scanner sc =new Scanner (System.in);
	int a=sc.nextInt();
	int b=sc.nextInt();
	int c=sc.nextInt();
	boolean p=false;
	if (c%a==0||c%b==0){

      System.out.print("yes");
      p=true;}
      else {
      	for(int i=1;i<c;i++){
      		for(int j=1;j<c;j++){
      		if (i*a+j*b==c){
      			System.out.print("yse");
      			p=true;
      			break;}

      		}
      		}
      }
if (p==false)
System.out.print("no");
	}
}

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.*;
import java.lang.*;

public class Submission {

    private static BufferedReader bi = new BufferedReader(new InputStreamReader(System.in));

    public static void main(String[] args){
        try{
            String[] nums = bi.readLine().split(" ");
            int ebonyDam = Integer.parseInt(nums[0]);
            int ivoryDam = Integer.parseInt(nums[1]);
            int shield = Integer.parseInt(nums[2]);
            if(shield == ebonyDam || shield == ivoryDam){
                System.out.println("Yes");
            } else{
                double y = 1.0;
                double x = 0.0;
                boolean shotsFired = true;
                while(y < shield && shotsFired){
                    x = (shield - (ivoryDam * y)) / ebonyDam;
                    if(x > 0 && (int)x == x){
                        System.out.println("Yes");
                        shotsFired = false;
                    }
                    y++;
                }
                if(shotsFired){
                    System.out.println("No");
                }
            }
        }catch(Exception e){
            System.out.println(e.getMessage());
        }

    }
}

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class AEbonyAndIvory {

    public static void main(String[] args) throws IOException {
        BufferedReader reader= new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st=new StringTokenizer(reader.readLine());
        int a=Integer.parseInt(st.nextToken());
        int b=Integer.parseInt(st.nextToken());
        int c=Integer.parseInt(st.nextToken());
        int r;
        while (b != 0)
          {
            r = a%b;
            a = b;
            b = r;
          }
        if(a==1)
            System.out.println("Yes");
        else
            System.out.println("No");
    }

}

/**
 * Created by Omar on 2/26/2016.
 */

import java.util.*;
import java.io.*;

public class A {
    static boolean ans=false;
    static int counter=0;
    static boolean done=false;
    static     String[] parts;
    static int c;
    public static void main(String[] args) throws Exception {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        PrintWriter pw = new PrintWriter(System.out);
        //int n=Integer.parseInt(br.readLine());
    parts=br.readLine().split(" ");
        //int[]a= new int[n];
        //for(int i=0;i<n;i++){a[i]=Integer.parseInt(parts[i]);}
        int a =Integer.parseInt(parts[0]);
        int b =Integer.parseInt(parts[1]);
         c =Integer.parseInt(parts[2]);

        for(int i=0;i<=10000;i++){
            for(int j=0;j<=10000;j++){
                if(i*a*j*b==c)ans=true;
            }
        }
        System.out.println(ans?"Yes":"No");
        pw.close();
        br.close();
    }
//    public static void dfs(int a,int b,int c){
//        if(c==0){ans=true; return;}
//        if(c-a>=0){
//            dfs(a,b,c-a);
//        }
//        if(c-b>=0){
//            dfs(a,b,c-b);
//        }
//        else
//        return;
//    }

}

import java.util.*;

public class Main {

    public static void main(String[] args) {

        Scanner sc=new Scanner(System.in);
        int a=sc.nextInt();
        int b=sc.nextInt();
        int c=sc.nextInt();
        String f="No";

        for (int i = 1; i < c; i++) {
            if ((c -a*i)/b ==0) {
                f="Yes"; break;
            }
        }

        System.out.println(f);

    }

}

import java.util.Scanner;
public class Main {

    public static void main(String[] args) {int a,b,c,d=0;
        Scanner s= new Scanner(System.in);
        a=s.nextInt();
        b=s.nextInt();
        c=s.nextInt();
        if(c==a || c==b ||a+b==c ||c-(a+b)==a ||c-(a+b)==b ||c%a==0 ||c%b==0 ||c%(a+b)==0) System.out.println("Yes");

                else
                    System.out.println("No");

    }

}

import java.util.Scanner;

public class EbonyAndIvory{

	public static void main(String[] args){

		Scanner kbd = new Scanner(System.in);

		int ebony = kbd.nextInt();
		int ivory = kbd.nextInt();
		int totalDamage = kbd.nextInt();

		int damageE;
		int damageI;
		boolean defeat = false;

		for(int x=0; x != totalDamage; x++){
			damageE = ebony*x;
			for(int y=0; y != totalDamage; y++){
				damageI = ivory*y;
				if(damageE + damageI == totalDamage){
					System.out.print("Yes");
					defeat = true;
					break;
				}
			}
		}
		if(defeat == false)
			System.out.print("No");
	}
}

import java.io.*;
import java.util.*;
public class d {
    public static void main(String args[]) throws IOException {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader sc = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        int n = sc.nextInt(), m = sc.nextInt(), c = sc.nextInt();
        boolean flag = false;
        for (int i = 0; i * m + n <= c; i++) {
            if ((i * m + n) % c == 0)
                flag = true;
        }
        out.print(flag ? "Yes" : "No");
        out.close();
    }
    static int ans=0;

    public static void shuffle(long[] arr) {
        int n = arr.length;
        Random rnd = new Random();
        for (int i = 0; i < n; ++i) {
            long tmp = arr[i];
            int randomPos = i + rnd.nextInt(n - i);
            arr[i] = arr[randomPos];
            arr[randomPos] = tmp;
        }
    }

    public static void shuffle(int[] arr) {
        int n = arr.length;
        Random rnd = new Random();
        for (int i = 0; i < n; ++i) {
            int tmp = arr[i];
            int randomPos = i + rnd.nextInt(n - i);
            arr[i] = arr[randomPos];
            arr[randomPos] = tmp;
        }
    }

    public static int gcd(int x, int y) {
        if (y == 0)
            return x;
        return gcd(y, x % y);
    }

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

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

        public long nextLong() {
            return Long.valueOf(next());
        }

        public double nextDouble() {
            return Double.valueOf(next());
        }

        String nextLine() throws IOException {
            return reader.readLine();
        }

    }
}
class pair{
    int dest;
    long weight;
    pair(int dest,long weight){
        this.dest=dest;
        this.weight=weight;
    }
}

import java.util.*;
public class Temp4	{

	public static void main(String args[]){
		try{
			Scanner sc = new Scanner(System.in);
			int a = sc.nextInt();
			int b = sc.nextInt();
			int c = sc.nextInt();
			boolean f = false;

			for(int i = 0; i<=100;i++){
				for(int j = 0;j<=100;j++){
					if( a*i+b*j == c){
						f = true;
						break;
					}
					if(f)
						break;
				}
			}
			if( f)
				System.out.println("Yes");
			else
				System.out.println("No");

		}catch(Exception e){}
	}
}

/*import java.util.*;
public class Temp4
{
	static int x, y;

    static int gcd(int a, int b){
        if( a == 0)	{  x = 0; y = 1;  return b; 	}
        if( b == 0)	{  x = 1; y = 9;  return a; 	}

		int d ;
        if( a > b){
			d =  gcd(b, a % b);
			int tempX = x;
			x = y;
			y = tempX - y* ( a / b );

		}
		else{
			d =  gcd(b % a, a);

			int tempY = y;
			y = x;
			x = tempY - x * ( b / a);

		}

		return d;

    }
	public static void main (String[] args) throws java.lang.Exception
	{
		try {

		    Scanner sc = new Scanner(System.in);
		 //   int t = sc.nextInt();
		   // while( t--> 0 ){
		        int a  = sc.nextInt();
				int b  = sc.nextInt();
		        int g = gcd(a,b);
		        System.out.println(x+" "+y+" "+g);
		    //}

		} catch(Exception e) {
		}
	}
}
*/

import java.util.Scanner;

public class Ebonyandivory {

	public static void main(String[] args) {
		Scanner sc = new Scanner (System.in);
		int a = sc.nextInt(), b = sc.nextInt() , c = sc.nextInt();
		int i = 0, j = 0;
		boolean verif = false;
		int x = 0;

		while((i*a)+(j*b) <= c || (j*a)+(i*b) <= c){
			if((i*a)+(j*b) == c || (j*a)+(i*b) == c){
				verif = true;
				break;
			}
			if(x % 2 == 0){
				i++;
			}
			else{
				j++;
			}
			x++;
		}
		System.out.println(verif==true?"YES":"NO");

	}

}

import java.io.*;

public class MyClass {
    public static void main(String args[]) throws IOException{
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        String[] vals = br.readLine().split(" ");
        int a = Integer.parseInt(vals[0]);
        int b = Integer.parseInt(vals[1]);
        int c = Integer.parseInt(vals[2]);

        int d = gcd(a, b);
        if((c >= a || c >= b) && (c%d) == 0)
            System.out.println("Yes");
        else
            System.out.println("No");

    }

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

import java.util.Scanner;
public class Ebony_and_Ivory {

	public static void main(String[] args) {
		Scanner kbd= new Scanner(System.in);
		int ebony =kbd.nextInt();
		int ivory = kbd.nextInt();
		int shield = kbd.nextInt();

		if(shield%ebony==0||shield%ivory==0)	{
			System.out.println("Yes");
			System.exit(0);
		}
		for(int temp=shield;temp>0;temp--)
		{
		int temp1=temp;
			if(temp%ebony==0 )
			{
				while(temp1<=shield)
				{
					temp1=temp1+ivory;
					if(temp1==shield)
					{
						System.out.println("Yes");
						System.exit(0);
					}
					else
					{
						System.out.println("No");
						System.exit(0);
					}
				}
			}
			else if(temp%ivory==0)
			{
				while(temp1<=shield)
				{
					temp1=temp1+ebony;
					if(temp1==shield)
					{
						System.out.println("Yes");
						System.exit(0);
					}
					else
					{
						System.out.println("No");
						System.exit(0);
					}

				}
			}
		}

		kbd.close();
		}
	}

import java.util.*;

public class Sample {
	public static void main(String[] args){

	  Scanner kbd = new Scanner(System.in);
	  int a = kbd.nextInt();
	  int b = kbd.nextInt();
	  int c = kbd.nextInt();
	  int flag = 0;
	  int i = 0;

		  for(i=0;i<=10000;i++){
			  if((c-i*b)%a==0){
			    if(((c-i*b)/a)<0){
			     System.out.println("Yes");
			     break;
			    }

			    flag=1;
			    break;
			  }
		  }
			  if(flag==0){
			   System.out.println("No");
			  }

	 }

}

import java.util.*;
public class EbonyIvory {

	static Scanner sc = new Scanner(System.in);
	static int a,b,c,x,y,d;

	public static int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }

	public static void main(String [] args) {
		a = sc.nextInt();
		b = sc.nextInt();
		c = sc.nextInt();
		d=gcd(a,b);
		System.out.println((c%d!=0||c<Math.min(a, b))?"Yes":"No");
	}
}

import java.util.Arrays;
import java.util.Scanner;
public class Main {

	static int o=1;
	public static void main(String[] args) {

		Scanner in = new Scanner(System.in);

	   int a = in.nextInt();
	   int b = in.nextInt();
	   int c = in.nextInt();

	   int min = Math.min(a, b);
	   int max = Math.max(a, b);
	   int k=0;

	   if(c % a == 0 || c % b == 0){
		   System.out.println("YES");
		   System.exit(0);
	   }

	   else {
		   k = c % min;

	      for(int i=1 ; i<=100 ; i++){
		       int r = a + b * i;
		       if(r == c){
		    	   System.out.println("YES");
		    	   System.exit(0);
		       }
	      } //end for

	      for(int i=1 ; i<=100 ; i++){

	    	  int r = a * i + b;
	    	  if(r == c){
		    	   System.out.println("YES");
		    	   System.exit(0);
		       }
	      }//end for

	      int l=1;
         for(int i=1 ; i<=100 ; i++){

	    	  int r = min * i + max * l;
	    	  if(r == c){
		    	   System.out.println("YES");
		    	   System.exit(0);
		       }
	    	  else if(i == 100){
	    		  i=1;
	    		  l = increase();
	    		  if(l == 101)
	    			  break;
	    	  }
	      }//end for

	   } //end else

	   System.out.println("NO");

	}

	public static int increase(){

		o++;

	    return o;
	}
}

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;

public class ProblemA {
	public static void main(String[] args) {
		InputReader in = new InputReader();
		PrintWriter out = new PrintWriter(System.out);

		new ProblemA().solve(in, out);

		out.close();
	}

	public void solve(InputReader in, PrintWriter out) {
		int a = in.nextInt();
		int b = in.nextInt();
		int c = in.nextInt();

		for (int i = 0; i <= 10000; i++) {
			if ((c - i * a) % b == 0) {
				out.print("Yes");

				return;
			}
		}

		out.print("No");
	}

	static class InputReader {
		public BufferedReader br;
		public StringTokenizer st;

		public InputReader() {
			br = new BufferedReader(new InputStreamReader(System.in));
		}

		public String next() {
			while (st == null || !st.hasMoreTokens()) {
				try {
					st = new StringTokenizer(br.readLine());
				} catch (IOException e) {
					throw new RuntimeException(e);
				}
			}
			return st.nextToken();
		}

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

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

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

		String nextLine() {
			String str = "";
			try {
				str = br.readLine();
			} catch (IOException e) {
				e.printStackTrace();
			}
			return str;
		}
	}
}

import java.io.InputStreamReader;
import java.io.BufferedReader;
import java.util.StringTokenizer;
import java.util.HashMap;
import java.math.BigInteger;
import java.util.Scanner;
import java.util.ArrayList;
 public class JavaApplication78 {
static double nextD(StringTokenizer tok){
    return Double.parseDouble(tok.nextToken());
}
public static int nextInt(StringTokenizer tok) {
        return Integer.parseInt(tok.nextToken());
    }
    public static void main(String[] args) throws Exception{
     BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
       StringTokenizer tok = new StringTokenizer(in.readLine());
       int a=nextInt(tok);int b=nextInt(tok);int c=nextInt(tok);
       int i= 1;
       if(Math.abs(c-a)%a==0||Math.abs(c-a)%b==0||Math.abs(c-b)%b==0||Math.abs(c-b)%a==0){
            System.out.println("Yes");System.exit(0);}
       else
       while(i*a<=c){
           if((c-(i*a))%b==0&&c-(i*a)>=0){
               System.out.println("Yes");
               System.exit(0);
           }
           i++;
       }

            System.out.println("No");

       }
    }

import java.util.*;

public class Sample {
	public static void main(String[] args){

	  Scanner kbd = new Scanner(System.in);
	  int a = kbd.nextInt();
	  int b = kbd.nextInt();
	  int c = kbd.nextInt();
	  int flag = 0;
	  int i = 0;

		  for(i=0;i<=10000;i++){
			  if((c-i*b)%a==0){
			    if(((c-i*b)/a)<0){
			     System.out.println("Yes");
			     break;
			    }

			    flag=1;
			    break;
			  }
			  if(flag==0){
			   System.out.println("No");
			  }
		   }

	 }

}

/*Ebony and Ivory*/
/*Contest 633*/
import java.util.*;

public class c633{
	public static void main(String[] args){
		Scanner input = new Scanner(System.in);
		int a = input.nextInt();
		int b = input.nextInt();
		int c = input.nextInt();
		boolean done = false;

		while(c>0){
			if((c%a==0)||(c%b==0)){
				System.out.println("Yes");
				done = true;
			}
			c=c-a;
		}
		if(!done){
			System.out.println("No");
		}
	}

}

import java.util.Scanner;

public class A633 {

	static Scanner sc = new Scanner(System.in);
	static int a,b,c;
	static boolean bool;

	public static void main(String[] args) {
		a = sc.nextInt();
		b = sc.nextInt();
		c = sc.nextInt();
		eq:
		for(int i = 0;i<=a;i++) {
			for(int j = 0;j<=b;j++) {
				if(i*a+j*b==c) {
					bool = true;
					break eq;
				}

			}
		}
	System.out.println(bool?"Yes":"No");
	}
}

import java.util.*;
import java.io.*;
public class first{
	public static void main(String[]args){
	Scanner inp = new Scanner(System.in);
	int x = inp.nextInt();
	int y = inp.nextInt();
	int z = inp.nextInt();
	if((z-(x+y))%x == 0 || (z-(x+y))%y == 0)
		System.out.println("Yes");
	else
		System.out.println("No");
	}
}

import java.util.Scanner;

public class EbonyandIvory {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(System.in);
		int a = sc.nextInt();
		int b = sc.nextInt();
		int c = sc.nextInt();
		for (int x = 0; a * x <= c; x++) {
			if (c - ((a * x) + b) == 0) {
				System.out.println("Yes");
				return;
			}
		}
		System.out.println("No");
	}

}

import java.util.Scanner;

public class Main {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner s=new Scanner(System.in);
		int a=s.nextInt();
		int b=s.nextInt();
		int c=s.nextInt();
		int count=0;
		if(a==c||c%a==0||b==c||c%b==0||c%(a+b)==0)
		{
			System.out.println("YES");
			count=1;
		}
		else
		{
			int req=c-(a+b);
			if(req%a==0||req%b==0){
			System.out.println("YES");
			count=1;}
		}
		if(count==0)
		{
			int count1=c/a,count2=0,count3;
			for(int i = 1;i<count1;i++)
			{
				count3=c;
				count2=a*i;
				count3-=count2;
				if(count3%b==0)
				{
					System.out.println("YES");
					count=1;
					break;
				}
			}
		}
		if(count==0)
			System.out.println("NO");
	}

}

import java.util.Scanner;

public class Main {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner s=new Scanner(System.in);
		int a=s.nextInt();
		int b=s.nextInt();
		int c=s.nextInt();
		int count=0;
		if(a==c||c%a==0||b==c||c%b==0||c%(a+b)==0)
		{
			System.out.println("YES");
			count=1;
		}
		else
		{
			int req=c-(a+b);
			if(req%a==0||req%b==0){
			System.out.println("YES");
			count=1;}
		}
		if(count==0)
			System.out.println("NO");
	}

}

import java.util.*;
public class Ebonyandvory {

    public static void main(String[]args) {
    	Scanner sc = new Scanner(System.in);
    	int x = sc.nextInt();
    	int y = sc.nextInt();
    	int z = sc.nextInt();
    	int count=0;
    	for(int i=1;i<=x;i++)
    	{for(int j=1;j<=x;j++)
    			if(i*x+j*y==z)
    				count++;
    	}
    	if(count>0)
    		System.out.print("YES");
    	else
    		System.out.print("NO");
    }

}

import java.util.*;;
public class Solution{
	public static void main(String args[]){
		Scanner in=new Scanner(System.in);
		int a=in.nextInt();
		int b=in.nextInt();
		int c=in.nextInt();
		int i=0;
		for(i=0;i*a<c;i++){
			for(int j=0;j*b<c;j++){
				if((a*i+b*j)==c)
				{System.out.println("Yes");i=c;break;}
			}
		}
		if(i!=c)
			System.out.println("No");
	}
}

/*	/ ﾌﾌ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀ム
	/ )\⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀  Y
	(⠀⠀| ( ͡° ͜ʖ ͡°）⠀⌒(⠀ ノ
	(⠀ ﾉ⌒ Y ⌒ヽ-く __／
	| _⠀｡ノ| ノ｡ |/
	(⠀ー '_人`ー ﾉ
	⠀|\ ￣ _人'彡ﾉ
	⠀ )\⠀⠀ ｡⠀⠀ /
	⠀⠀(\⠀ #⠀ /
	⠀/⠀⠀⠀/ὣ====================D-
	/⠀⠀⠀/⠀ \ \⠀⠀\
	( (⠀)⠀⠀⠀⠀ ) ).⠀)
	(⠀⠀)⠀⠀⠀⠀⠀( | /
	|⠀ /⠀⠀⠀⠀⠀⠀ | /
	[_] ⠀⠀⠀⠀⠀[___]                     */
// Main Code at the Bottom
import java.util.*;
import java.lang.*;
import java.io.*;
public class Main {
	//Fast IO class
    static class FastReader {
        BufferedReader br;
        StringTokenizer st;
        public FastReader() {
        	boolean env=System.getProperty("ONLINE_JUDGE") != null;
        	if(!env) {
        		try {
					br=new BufferedReader(new FileReader("src\\input.txt"));
				} catch (FileNotFoundException e) {
					e.printStackTrace();
				}
        	}
        	else br = new BufferedReader(new InputStreamReader(System.in));
        }
        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                }
                catch (IOException  e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }
        int nextInt() {
            return Integer.parseInt(next());
        }
        long nextLong() {
            return Long.parseLong(next());
        }
        double nextDouble() {
            return Double.parseDouble(next());
        }
        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            }
            catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }
    static long MOD=1000000000+7;
    //Euclidean Algorithm
    static long gcd(long A,long B){
        if(B==0) return A;
        return gcd(B,A%B);
    }
    //Modular Exponentiation
    static long fastExpo(long x,long n){
        if(n==0) return 1;
        if((n&1)==0) return fastExpo((x*x)%MOD,n/2)%MOD;
        return ((x%MOD)*fastExpo((x*x)%MOD,(n-1)/2))%MOD;
    }
    //Modular Inverse
    static long inverse(long x) {
    	return fastExpo(x,MOD-2);
    }
    //Prime Number Algorithm
    static boolean isPrime(long n){
        if(n<=1) return false;
        if(n<=3) return true;
        if(n%2==0 || n%3==0) return false;
        for(int i=5;i*i<=n;i+=6) if(n%i==0 || n%(i+2)==0) return false;
        return true;
    }
    //Reverse an array
    static void reverse(int arr[],int l,int r){
    	while(l<r) {
    		int tmp=arr[l];
    		arr[l++]=arr[r];
    		arr[r++]=tmp;
    	}
    }
    //Print array
    static void print1d(int arr[]) {
    	out.println(Arrays.toString(arr));
    }
    static void print2d(int arr[][]) {
    	for(int a[]: arr) out.println(Arrays.toString(a));
    }
    // Pair
    static class pair{
    	long x,y;
    	pair(long a,long b){
    		this.x=a;
    		this.y=b;
    	}
    	public boolean equals(Object obj) {
    		if(obj == null || obj.getClass()!= this.getClass()) return false;
            pair p = (pair) obj;
            return (this.x==p.x && this.y==p.y);
        }
    	public int hashCode() {
            return Objects.hash(x,y);
        }
    }
    static FastReader sc=new FastReader();
    static PrintWriter out=new PrintWriter(System.out);
    //Main function(The main code starts from here)
    public static void main (String[] args) throws java.lang.Exception {
    	int test=1;
        while(test-->0) {
        	int a=sc.nextInt(),b=sc.nextInt(),c=sc.nextInt();
        	if(c%(gcd(a,b))==0) out.println("Yes");
        	else out.println("No");
        }
        out.flush();
        out.close();
    }
}

import java.util.Scanner;

public class IvoryEbony {

	public static void main(String[] args) {
		Scanner input = new Scanner(System.in);
		int x = input.nextInt();
		int y = input.nextInt();
		int target = input.nextInt();
		if(target == 0){
			System.out.println("Yes");
		}
		boolean divisible = false;
		if(x % target == 0 || y % target == 0){
			System.out.println("Yes");
			divisible = true;
		}
		int tempDecrementer = target;
		while(tempDecrementer > 0 && !divisible){
			tempDecrementer -= x;
			if(tempDecrementer % y == 0 && tempDecrementer > 0){
				divisible = true;
				System.out.println("Yes");
			}
		}
		if(!divisible){
			System.out.println("No");
		}

	}

}

import java.io.*;
import java.util.*;
public class EbonyAndIvory
{
    public static void main(String args[])
    {
        Scanner sc=new Scanner(System.in);
        int a=sc.nextInt();
        int b=sc.nextInt();
        int c=sc.nextInt();
        if(c<Math.min(a,b))
            System.out.println("No");
        else if(c%a==0 || c%b==0)
            System.out.println("Yes");
        else if((c-a)%b==0 || ((c-b)%a==0))
            System.out.println("Yes");
        else
            System.out.println("No");
    }
}

import java.util.Scanner;

public class A {

	public static void main(String[] args) {
		Scanner s=new Scanner(System.in);
		int a=s.nextInt(),b=s.nextInt(),c=s.nextInt();
		if(a==c || b==c) {
			System.out.println("Yes");
		} else if(findgcd(a, b) == 1)
			System.out.println("Yes");
		else
			System.out.println("No");
	}

	public static int findgcd(int a, int b) {
		while(a!=0 && b!=0) {
			int c = b;
			b = a%b;
			a = c;
		}
		return a+b;
	}
}

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class AEbonyAndIvory {

    public static void main(String[] args) throws IOException {
        BufferedReader reader= new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st=new StringTokenizer(reader.readLine());
        int a=Integer.parseInt(st.nextToken());
        int b=Integer.parseInt(st.nextToken());
        int c=Integer.parseInt(st.nextToken());
        boolean test=false;
        for (int i = 0; i < 10000; i++) {
            for (int j = 0; j < c; j++) {
                if(a*i+b*j==c)
                {
                    test=true;
                    break;
                }
            }
            if(test)
                break;
        }
        if(test)
            System.out.println("Yes");
        else
            System.out.println("No");
    }

}

import java.io.*;
import java.util.*;
public class Main{
    public static void main(String args[]){
        Scanner inp=new Scanner(System.in);
        int a=inp.nextInt(),b=inp.nextInt(),c=inp.nextInt();
        if((c<a)&&(c<b)) System.out.println("No");
        else if(c==a||(c==b)) System.out.println("Yes");
        else{
            if(((c%(a+b))%a==0)||((c%(a+b))%b==0)) System.out.println("Yes");
            else System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Task01 {

public static void main(String[] args) {
	Scanner input = new Scanner(System.in);
	long a = input.nextLong();
	long b = input.nextLong();
	long c = input.nextLong();
	long x,y;
	String rez="No";
	for (long i=1; i<=c; i++){
		x=i;
		if (a*x>c||b>c){break;}
		y=(c-a*x)%b;
		if (y==0){
			rez="Yes";
			break;
		}
	}

	System.out.print(rez);
	}
}

import java.util.*;
import java.io.*;
import java.lang.*;

public class A633 {

  public static void main(String[] args) {

    int gun1, gun2, needed;
    boolean possible = false;

    Scanner s = new Scanner(System.in);
    gun1 = s.nextInt();
    gun2 = s.nextInt();
    needed = s.nextInt();

    if(needed % gun1 == 0) possible = true;
    if(needed % gun2 == 0) possible = true;

    System.out.println(needed);

    if(!possible && gun1 > gun2) {
      int change = needed / gun1;
      needed -= gun1*change;
    System.out.println(needed);
      for(int i=0; i< change && !possible; i++){
        needed += gun1*(gun1-gun2);
        if(needed % gun2 == 0)
          possible = true;
      }
    }
    else if(!possible && gun2 > gun1) {
      int change = needed / gun2;
      needed -= gun2*change;
      for(int i=0; i< change && !possible; i++){
        needed += gun2*(gun2-gun1);
        if(needed % gun1 == 0)
          possible = true;
      }
    }

    if (possible)
      System.out.println("YES");
    else
      System.out.println("NO");
  }
}

import java.io.*;
import java.util.InputMismatchException;

public class Main2 {
    public static void main(String[] xps){
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        StringBuilder sb = new StringBuilder();

            int a = in.Int();
            int b = in.Int();
            int c = in.Int();
            int[] values = new Diophantine().findAnySolution(a, b, c);
            if (values.length == 0)
                out.println("No");
            else if (values[0] >= 0 && values[1] >= 0)
                out.println("Yes");
            else
                out.println("No");
        out.close();
    }

    private static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;
        private SpaceCharFilter filter;

        public InputReader(InputStream stream) {
            this.stream = stream;
        }

        public int read() {
            if (numChars == -1) {
                throw new InputMismatchException();
            }
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
                if (numChars <= 0) {
                    return -1;
                }
            }
            return buf[curChar++];
        }

        public int Int() {
            int c = read();
            while (isSpaceChar(c)) {
                c = read();
            }
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            int res = 0;
            do {
                if (c < '0' || c > '9') {
                    throw new InputMismatchException();
                }
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public String String() {
            int c = read();
            while (isSpaceChar(c)) {
                c = read();
            }
            StringBuilder res = new StringBuilder();
            do {
                res.appendCodePoint(c);
                c = read();
            } while (!isSpaceChar(c));
            return res.toString();
        }

        public double Double() {
            int c = read();
            while (isSpaceChar(c)) {
                c = read();
            }
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            double res = 0;
            while (!isSpaceChar(c) && c != '.') {
                if (c == 'e' || c == 'E') {
                    return res * Math.pow(10, Int());
                }
                if (c < '0' || c > '9') {
                    throw new InputMismatchException();
                }
                res *= 10;
                res += c - '0';
                c = read();
            }
            if (c == '.') {
                c = read();
                double m = 1;
                while (!isSpaceChar(c)) {
                    if (c == 'e' || c == 'E') {
                        return res * Math.pow(10, Int());
                    }
                    if (c < '0' || c > '9') {
                        throw new InputMismatchException();
                    }
                    m /= 10;
                    res += (c - '0') * m;
                    c = read();
                }
            }
            return res * sgn;
        }

        public long Long() {
            int c = read();
            while (isSpaceChar(c)) {
                c = read();
            }
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            long res = 0;
            do {
                if (c < '0' || c > '9') {
                    throw new InputMismatchException();
                }
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public boolean isSpaceChar(int c) {
            if (filter != null) {
                return filter.isSpaceChar(c);
            }
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        public String next() {
            return String();
        }

        public interface SpaceCharFilter {
            public boolean isSpaceChar(int ch);
        }
    }
}

class Diophantine {
    public int[] gcd(int p, int q) {
        if (q == 0)
            return new int[] {p, 1, 0};

        int[] values = gcd(q, p % q);
        int d = values[0];
        int a = values[2];
        int b = values[1] - (p / q) * values[2];

        return new int[]{d, a, b};
    }

    public int[] findAnySolution(int a, int b, int c) {
        int[] values = gcd(Math.abs(a), Math.abs(b));
        int g = values[0];
        int x0 = values[1];
        int y0 = values[2];

        if (c % g != 0) {
            return new int[]{};
        }

        x0 *= c / g;
        y0 *= c / g;

        if (a < 0)
            x0 = -x0;
        if (b < 0)
            y0 = -y0;

        return new int[]{ x0, y0 , g};
    }
}

import java.util.Scanner;

public class IvoryEbony {

	public static void main(String[] args) {
		Scanner input = new Scanner(System.in);
		int x = input.nextInt();
		int y = input.nextInt();
		int target = input.nextInt();
		if(target == 0){
			System.out.println("Yes");
			System.exit(0);
		}
		if(x % target == 0 || y % target == 0){
			System.out.println("Yes");
		}else{
			if(factorsDivide(x, y, target)){
				System.out.println("Yes");
			}else{
				System.out.println("No");
			}
		}

	}
	public static boolean factorsDivide(int x, int y, int t){
		for(int i = x; i < t; i+=x){
			if(i % y == 0 && i > y){
				return true;
			}
		}
		return false;
	}

}

import java.io.*;
import java.math.BigInteger;
import java.util.*;

public class Main {

	static int max = 500005;
	static long counter[] = new long[max];
	static long dp[] = new long[max];

	public static void main(String[] args) {

		Scanner sc = new Scanner(new BufferedReader(new InputStreamReader(System.in)));

		int a = sc.nextInt();
		int b = sc.nextInt();
		int c = sc.nextInt();

	if(c % gcd(a, b) == 0)
		System.out.println("Yes");
	else
		System.out.println("No");

		sc.close();
	}

	private static int gcd(int a, int b){
		if(a == 0)
			return b;
		else if(b == 0)
			return a;
		else return gcd(b, a % b);
	}

	private static boolean canDamage(int a, int b, int c){

		System.out.println(c);
		if(c < 0)
			return false;
		if(c == 0)
			return true;

		 if(c < a && c < b)
			 return false;

//		if(c % a == 0 || c % b == 0)
//			return true;
//
		return canDamage(a, b, c - a) | canDamage(a, b, c - b);

	}

}

import java.util.Scanner;

public class Acm {
	public static void main(String args[]){
		Scanner sc= new Scanner(System.in);

		int a=sc.nextInt(); int b =sc.nextInt(); int c=sc.nextInt();
		int min =Math.max(b, a);
		boolean d= false ;
		while(true){
			c=c-min ;
			if(c%a==0 ||c%b==0)
			{
				d=true;break ;
			}
			if(c<=0)break ;

		}
		System.out.println(d?"Yes":"No");

	}

	}

// 1000

import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class Main {
	InputStream is;
	PrintWriter out;
	String INPUT = "";

	void solve()
	{
		int a = ni(), b = ni(), c = ni();
		int g = gcd(a, b);
		out.println(c % g == 0 ? "Yes" : "No");
	}

	public int gcd(int a, int b) {
		while(b > 0) {
			int t = a % b;
			a = b;
			b = t;
		}
		return a;
	}

	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);

		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
	}

	public static void main(String[] args) throws Exception { new Main().run(); }

	private byte[] inbuf = new byte[1024];
	public int lenbuf = 0, ptrbuf = 0;

	private int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}

	private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }

	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }

	private String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}

	private char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}

	private char[][] nm(int n, int m)
	{
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}

	private int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}

	private int ni()
	{
		int num = 0, b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}

		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}

	private long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}

		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}

	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}

import java.util.*;

public class Lucky {

	public static void main(String[] args) {
		Scanner clavier=new Scanner(System.in);
		int a=clavier.nextInt();
		int b=clavier.nextInt();
		int c=clavier.nextInt();
		//int t=0;
		int y=0;
		for(int i=0;i<=101;i++)
		{for(int k=0;k<=100;k++)
			{if(((a*k)+(b*i)==c )|| ((b*k)+(a*i)==c) )
				{y=1;
				System.out.println("YES");
				break;}}
				if(y==1)
					{break;}
		     }
		if(y!=1)
			System.out.println("NO");

	}

}

import java.util.Scanner;

public class First {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		int n = sc.nextInt();
		int s = sc.nextInt();
		int e = sc.nextInt();

	 if(n*1==e){
		 System.out.print("Yes");

	 }else if(n*1+s*2==e){
		 System.out.print("Yes");
	 }
	 else{
		 System.out.print("No");
	 }
	}

}

import java.io.*;
import java.math.BigInteger;
import java.util.*;

public class Main {

	static int max = 500005;
	static long counter[] = new long[max];
	static long dp[] = new long[max];

	public static void main(String[] args) {

		Scanner sc = new Scanner(new BufferedReader(new InputStreamReader(System.in)));

		int a = sc.nextInt();
		int b = sc.nextInt();
		int c = sc.nextInt();

//		System.out.println(gcd(a,b));
	   if(c % gcd(a, b) == 0){
		for(int x = 0; x <= c / a; x++){
			if(c - (x * a) % b == 0){
				System.out.println("Yes");
				return;
			}

		}
		System.out.println("No");

	}
	else
		System.out.println("No");

		sc.close();
	}

	private static int gcd(int a, int b){
		if(a == 0)
			return b;
		else if(b == 0)
			return a;
		else return gcd(b, a % b);
	}

	private static boolean canDamage(int a, int b, int c){

		System.out.println(c);
		if(c < 0)
			return false;
		if(c == 0)
			return true;

		 if(c < a && c < b)
			 return false;

//		if(c % a == 0 || c % b == 0)
//			return true;
//
		return canDamage(a, b, c - a) | canDamage(a, b, c - b);

	}

}

import java.util.Arrays;
import java.util.Scanner;

/**
 *
 * @author AdminHP-262
 */
public class EbonyandIvory {

    public static void main(String[] args) throws Exception {
        Scanner scanner = new Scanner(System.in);

        int a = scanner.nextInt();
        int b = scanner.nextInt();
        int c = scanner.nextInt();

        if (c % a == 0 || c % b == 0) {
            System.out.println("Yes");
        } else {
            if (a > c && b > c) {
                System.out.println("No");
                return;
            }
            int temp = 0;
            while (temp <= c) {
                temp += b;
                if ((c - temp) % a == 0) {
                    System.out.println("Yes");
                    return;
                }
            }
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class IvoryEbony {

	public static void main(String[] args) {
		Scanner input = new Scanner(System.in);
		int x = input.nextInt();
		int y = input.nextInt();
		int target = input.nextInt();
		if(target == 0){
			System.out.println("No");
		}
		boolean divisible = false;
		if(x % target == 0 || y % target == 0){
			System.out.println("Yes");
			divisible = true;
		}
		int tempDecrementer = target;
		while(tempDecrementer > 0 && !divisible){
			tempDecrementer -= x;
			if(tempDecrementer % y == 0 && tempDecrementer > 0){
				divisible = true;
				System.out.println("Yes");
			}
		}
		if(!divisible){
			System.out.println("No");
		}

	}

}

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.StringTokenizer;

public class fam {

    public static void main(String[] args) throws IOException, InterruptedException {
        FastScanner in = new FastScanner(System.in);
        PrintWriter writer = new PrintWriter(System.out);
        StringBuilder sb = new StringBuilder("");

        int a=in.nextInt();
        int b=in.nextInt();
        int c=in.nextInt();
        int rem_a = c % a;
        int rem_b = c % b;

        if(rem_a==0 || rem_b==0)
        	writer.println("Yes");
        else if(a>c || b>c || a+b >c)
            writer.println("No");

        else if(a%2==0 && b%2 !=0)
        	writer.println("Yes");
        else if(a%2!=0 && b%2 ==0)
        	writer.println("Yes");
        else
        	writer.print("No");

      //  writer.println(sb.toString());
        writer.close();
        in.close();
    }
}

class FastScanner {

    BufferedReader reader;
    StringTokenizer tokenizer;

    public FastScanner(InputStream stream) {
        this.reader = new BufferedReader(new InputStreamReader(stream));
    }

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

    public int[] nextIntegerArray(int n) throws IOException {
        int[] a = new int[n];
        for (int i = 0; i < a.length; i++) {
            a[i] = nextInt();
        }
        return a;
    }

    public long[] nextLongArray(int n) throws IOException {
        long[] a = new long[n];
        for (int i = 0; i < a.length; i++) {
            a[i] = nextLong();
        }
        return a;
    }

    public int nextInt(int radix) throws IOException {
        return Integer.parseInt(next(), radix);
    }

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

    public long nextLong(int radix) throws IOException {
        return Long.parseLong(next(), radix);
    }

    public double nextDouble() throws IOException {
        return Double.parseDouble(next());
    }

    public BigInteger nextBigInteger() throws IOException {
        return new BigInteger(next());
    }

    public BigInteger nextBigInteger(int radix) throws IOException {
        return new BigInteger(next(), radix);
    }

    public String next() throws IOException {
        if (tokenizer == null || !tokenizer.hasMoreTokens()) {
            tokenizer = new StringTokenizer(reader.readLine());
            return this.next();
        }
        return tokenizer.nextToken();
    }

    public void close() throws IOException {
        this.reader.close();
    }
}

import java.io.IOException;
import java.util.*;

public class Main {

	public static void main(String[] args) throws NumberFormatException, IOException {
		Scanner scn = new Scanner(System.in);
		int a = scn.nextInt();
		int b = scn.nextInt();
		int c = scn.nextInt();

		if (find_any_solution(a, b, c)) {
			System.out.println("Yes");
		} else {
			System.out.println("No");
		}
	}

	static int x, y, g;

	public static boolean find_any_solution(int a, int b, int c) {
		g = extendedeuclid(Math.abs(a), Math.abs(b));
		if (c % g != 0) {
			return false;
		}
		if (x < 0 || y < 0) {
			return false;
		}
		return true;
	}

	public static int extendedeuclid(int a, int b) {
		if (b == 0) {
			x = 1;
			y = 0;
			return a;
		}

		int x1;
		int y1;
		int gcd = extendedeuclid(b, a % b);

		x1 = x;
		y1 = y;

		y = x1 - (a / b) * y1;
		x = y1;
		return gcd;
	}
}

import java.util.*;
import java.lang.*;
import java.io.*;

/* Name of the class has to be "Main" only if the class is public. */
public class Ideon
{
    public static void main(String[] args)
    {
      int a,b,c,d;
      Scanner in= new Scanner (System.in);
      a=in.nextInt();
      b=in.nextInt();
      c=in.nextInt();
      d=c;
      while(d>0)
              {
               if(d%a==0||d%b==0)
               {
                      System.out.println("Yes");
                   System.exit(0);

               }else
               {
                   d=d-a;
               }
              }
        while(c>0)
              {
               if(c%a==0||d%b==0)
               {
                   System.out.println("Yes");
                   System.exit(0);

               }else
               {
                   c=c-a;
               }
              }
               System.out.println("No");

    }
}

import java.util.Scanner;

public class Lololols {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner scan = new Scanner(System.in);
		int bl = scan.nextInt();
		int w = scan.nextInt();
		int ex = scan.nextInt();
		if (w > ex && bl > ex) {
			System.out.println("No");
		} else {

			if (w == ex || bl == ex || ex % bl == 0 || w % bl == 0) {
				System.out.println("Yes");
			} else {

				boolean t = false;
				for (int i = ex; i - bl > 0; i = i - bl) {
					if (i % w == 0) {
						t = true;
					}
				}
				for (int i = ex; i - w > 0; i = i - w) {
					if (i % bl == 0) {
						t = true;
					}
				}
				if (t) {
					System.out.println("Yes");
				} else {
					System.out.println("No");
				}
			}
		}
	}

}

import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.PrintWriter;

// this is not good for reading double values.
public class specialnumbers {
	public static void main(String[] args) throws IOException {
		Reader r = new Reader();
		PrintWriter o = new PrintWriter(System.out, false);
		int a = r.nextInt();
		int b = r.nextInt();
		int c = r.nextInt();
		boolean flag = false;
		for(int i=0;i<=(c/a)+1;i++){
			for(int j=0;j<=(c/b)+1;j++){
				if((a*i+b*j)==c){
					o.println("Yes");
					flag = true;
					break;
				}
			}
		}
		if(!flag){
			o.println("No");
		}
		o.close();
	}

	static class pair {
		int x, y;

		public pair(int x, int y) {
			// TODO Auto-generated constructor stub
			this.x = x;
			this.y = y;
		}
	}

	static int gcd(int n, int r) {
		return r == 0 ? n : gcd(r, n % r);
	}

	static long gcd(long n, long r) {
		return r == 0 ? n : gcd(r, n % r);
	}

	static class Reader {
		final private int BUFFER_SIZE = 1 << 16;
		private DataInputStream din;
		private byte[] buffer;
		private int bufferPointer, bytesRead;

		public Reader() {
			din = new DataInputStream(System.in);
			buffer = new byte[BUFFER_SIZE];
			bufferPointer = bytesRead = 0;
		}

		public Reader(String file_name) throws IOException {
			din = new DataInputStream(new FileInputStream(file_name));
			buffer = new byte[BUFFER_SIZE];
			bufferPointer = bytesRead = 0;
		}

		public final String readString() throws IOException {
			int c = read();
			while (isSpaceChar(c)) {
				c = read();
			}
			StringBuilder res = new StringBuilder();
			do {
				res.append((char) c);
				c = read();
			} while (!isSpaceChar(c));
			return res.toString();
		}

		private boolean isSpaceChar(int c) {
			return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
		}

		public int nextInt() throws IOException {
			int ret = 0;
			byte c = read();
			while (c <= ' ')
				c = read();
			boolean neg = (c == '-');
			if (neg)
				c = read();
			do {
				ret = ret * 10 + c - '0';
			} while ((c = read()) >= '0' && c <= '9');
			if (neg)
				return -ret;
			return ret;
		}

		public long nextLong() throws IOException {
			long ret = 0;
			byte c = read();
			while (c <= ' ')
				c = read();
			boolean neg = (c == '-');
			if (neg)
				c = read();
			do {
				ret = ret * 10 + c - '0';
			} while ((c = read()) >= '0' && c <= '9');
			if (neg)
				return -ret;
			return ret;
		}

		public double nextDouble() throws IOException {
			double ret = 0, div = 1;
			byte c = read();
			while (c <= ' ')
				c = read();
			boolean neg = (c == '-');
			if (neg)
				c = read();
			do {
				ret = ret * 10 + c - '0';
			} while ((c = read()) >= '0' && c <= '9');
			if (c == '.')
				while ((c = read()) >= '0' && c <= '9')
					ret += (c - '0') / (div *= 10);
			if (neg)
				return -ret;
			return ret;
		}

		public int[] readIntArray(int size) throws IOException {
			int[] arr = new int[size];
			for (int i = 0; i < size; i++)
				arr[i] = nextInt();
			return arr;
		}

		public long[] readLongArray(int size) throws IOException {
			long[] arr = new long[size];
			for (int i = 0; i < size; i++)
				arr[i] = nextInt();
			return arr;
		}

		private void fillBuffer() throws IOException {
			bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
			if (bytesRead == -1)
				buffer[0] = -1;
		}

		private byte read() throws IOException {
			if (bufferPointer == bytesRead)
				fillBuffer();
			return buffer[bufferPointer++];
		}

		public void close() throws IOException {
			if (din == null)
				return;
			din.close();
		}
	}
}