Karafs is some kind of vegetable in shape of an 1 × h rectangle. Tavaspolis people love Karafs and they use Karafs in almost any kind of food. Tavas, himself, is crazy about Karafs.

<image>

Each Karafs has a positive integer height. Tavas has an infinite 1-based sequence of Karafses. The height of the i-th Karafs is si = A + (i - 1) × B.

For a given m, let's define an m-bite operation as decreasing the height of at most m distinct not eaten Karafses by 1. Karafs is considered as eaten when its height becomes zero.

Now SaDDas asks you n queries. In each query he gives you numbers l, t and m and you should find the largest number r such that l ≤ r and sequence sl, sl + 1, ..., sr can be eaten by performing m-bite no more than t times or print -1 if there is no such number r.

Input

The first line of input contains three integers A, B and n (1 ≤ A, B ≤ 106, 1 ≤ n ≤ 105).

Next n lines contain information about queries. i-th line contains integers l, t, m (1 ≤ l, t, m ≤ 106) for i-th query.

Output

For each query, print its answer in a single line.

Examples

Input

2 1 4
1 5 3
3 3 10
7 10 2
6 4 8


Output

4
-1
8
-1


Input

1 5 2
1 5 10
2 7 4


Output

1
2
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.nio.ReadOnlyBufferException;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.PriorityQueue;
import java.util.Queue;
import java.util.Random;
import java.util.Stack;
import java.util.StringTokenizer;
import java.util.TreeSet;


public class R299 {
	public static InputReader in;
	public static PrintWriter out;
	public static Random ra = new Random(0);

	public static void main(String[] args) {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		in = new InputReader(inputStream);
		out = new PrintWriter(outputStream, true);

		TavasAndKarafs();

		out.close();
	}

	public static void TavasAndKarafs() {
		long A = in.nextLong();
		long B = in.nextLong();
		long n = in.nextLong();
		
		for (int i = 0; i < n; i++) {
			long L = in.nextLong();
			long T = in.nextLong();
			long M = in.nextLong();
			
			// shortest possible
			if (f(A, B, L) > T) {
				out.println(-1);
			} else {
				long low = L;
				long high = getX(A, B, L, T, L+M*T);
				long lastValid = -1;
				while (low <= high) {
					long mid = (low + high) >>> 1;
					long fx = fs(A, B, L, mid);
					if (fx <= T*M) {
						low = mid + 1;
						lastValid = mid;
					} else if (fx > T*M) {
						high = mid - 1;
					}
				}
				out.println(lastValid);
			}
		}
	}

	public static long getX(long a, long b, long L, long F, long max) {
		long low = L;
		long high = max;
		long lastValid = -1;
		while (low <= high) {
			long mid = (low + high) >>> 1;
			long fx = f(a, b, mid);
			if (fx <= F) {
				low = mid + 1;
				lastValid = mid;
			} else if (fx > F) {
				high = mid - 1;
			}
		}
		return lastValid;
	}

	public static long f(long a, long b, long x) {
		return a + (x-1)*b;
	}

	public static long fs(long a, long b, long L, long R) {
		return (R-L+1)*a + b*(R*(R-1) - (L-1)*(L-2))/2;
	}

	public 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.parseLong(next());}
		public double nextDouble() {return Double.parseDouble(next());}
		public long[] nextLongArray(int n) {
			long[] a = new long[n];
			for (int i = 0; i < a.length; i++) a[i] = this.nextLong();
			return a;
		}
		public int[] nextIntArray(int n) {
			int[] a = new int[n];
			for (int i = 0; i < a.length; i++) a[i] = this.nextInt();
			return a;
		}
	}
}
