// Arup Guha
// 9/25/2018
// Alternate Solution to 2018 NAQ Problem: Das Blinken Lights

import java.util.*;

public class dasblinkenlights {
	
	public static void main(String[] args) {
		
		// Get input.
		Scanner stdin = new Scanner(System.in);
		int period1 = stdin.nextInt();
		int period2 = stdin.nextInt();
		int limit = stdin.nextInt();
		
		// Since we have small numbers no need to worry about overflow.
		// This is the standard formula that relates GCD to LCM.
		int repeat = period1*period2/gcd(period1, period2);
		
		// Output if the lights align fast enough or not.
		if (repeat <= limit)
			System.out.println("yes");
		else
			System.out.println("no");
	}
	
	public static int gcd(int a, int b) {
		return b == 0 ? a : gcd(b, a%b);
	}

}