Problem: A line on the plane is described by an equation Ax + By + C = 0. You are to find any point on this line, whose coordinates are integer numbers from  - 5·1018 to 5·1018 inclusive, or to find out that such points do not exist.

Input

The first line contains three integers A, B and C ( - 2·109 ≤ A, B, C ≤ 2·109) — corresponding coefficients of the line equation. It is guaranteed that A2 + B2 > 0.

Output

If the required point exists, output its coordinates, otherwise output -1.

Examples

Input

2 5 3


Output

6 -3

Solution (in JAVA):

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


public class hello {
	public static class FastReader {
		BufferedReader br;
		StringTokenizer st;

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

		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;
		}
	}
	public static FastReader sc = new FastReader();
	public static void take_array(long arr[], int size) {
		for (int i = 0; i < size; i++) {
			arr[i] = sc.nextLong();
		}
	}
	public static void print_arr(long arr[]) {
		for (long x : arr)
			System.out.print(x + " ");
	}
	public static String[] convert_String_to_arr(String s) {
		String arr[] = new String[s.length()];
		for (int i = 0; i < s.length(); i++) {
			arr[i] = String.valueOf(s.charAt(i));
		}
		return arr;
	}
	public static void take_prefix_array(long arr[], int size, long []prefix) {
		long temp = 0;
		for (int i = 0; i < size; i++) {
			temp += arr[i];
			prefix[i] = temp;
		}
	}
	public static void print(Object c, int a) {
		if (a == -1)
			System.out.print(c + " ");
		else
			System.out.println(c);
	}
	public static void space() {
		System.out.println();
	}
	public static long sum_array(long arr[]) {
		long sum = 0;
		for (long x : arr)
			sum += x;
		return sum;
	}
	public static void swap(long a, long b) {
		long temp = a;
		a = b;
		b = temp;
	}
	public static long min(long a, long b, long c) {
		return Math.min(a, Math.min(b, c));
	}
	public static long max(long a, long b, long c) {
		return Math.max(a, Math.max(b, c));
	}
	public static long gcd(long a, long b) {
		if (a < b)swap(a, b);
		if (b == 0)return a;
		return gcd(b, a % b);
	}
	public static long sol(long a, long b) {
		if (b == 0) {
			x = 1; y = 0;
			return a;
		}
		long res = sol(b, a % b);
		long t = x;
		x = y;
		y = (t - (a / b) * y);
		return res;
	}
	public static long x, y;
	public static void main(String []args) {
		long a = sc.nextLong(), b = sc.nextLong(), c = sc.nextLong();
		long g = sol(a, b);
		if (c % g != 0)
			print(-1, 0);
		else {
			long k = (-c) / g;
			print(k * x + " " + k * y, 0);
		}
	}
}