Problem: You are given a rectangular grid of lattice points from (0, 0) to (n, m) inclusive. You have to choose exactly 4 different points to build a polyline possibly with self-intersections and self-touching. This polyline should be as long as possible.

A polyline defined by points p1, p2, p3, p4 consists of the line segments p1 p2, p2 p3, p3 p4, and its length is the sum of the lengths of the individual line segments.

Input

The only line of the input contains two integers n and m (0 ≤ n, m ≤ 1000). It is guaranteed that grid contains at least 4 different points.

Output

Print 4 lines with two integers per line separated by space — coordinates of points p1, p2, p3, p4 in order which represent the longest possible polyline.

Judge program compares your answer and jury's answer with 10 - 6 precision.

Examples

Input

1 1


Output

1 1
0 0
1 0
0 1


Input

0 10


Output

0 1
0 10
0 0
0 9

Solution (in JAVA):

Solution:
import java.io.InputStreamReader;
import java.io.IOException;
import java.util.Set;
import java.io.BufferedReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.util.HashSet;
import java.io.InputStream;

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

class TaskB {
	public void solve(int testNumber, FastScanner in, PrintWriter out) {
		int n = in.nextInt();
		int m = in.nextInt();
		Set<Integer> candidates = new HashSet<Integer>();
		int[] cornerX = {0, n, 0, n};
		int[] cornerY = {0, 0, m, m};
		for (int dx = -1; dx <= 1; dx++) {
			for (int dy = -1; dy <= 1; dy++) {
				for (int i = 0; i < 4; i++) {
					int x = cornerX[i] + dx;
					int y = cornerY[i] + dy;
					if (x < 0 || x > n || y < 0 || y > m) continue;
					candidates.add(2000*x + y);
				}
			}
		}
		int[] xs = new int[candidates.size()];
		int[] ys = new int[candidates.size()];
		int k = 0;
		for (int key : candidates) {
			xs[k] = key / 2000;
			ys[k] = key % 2000;
			++k;
		}
		rec(xs, ys, 0, new int[4], 0, -1);
		for (int i : bestIndices) {
			out.println(xs[i] + " " + ys[i]);
		}
	}

	double best = 0;
	int[] bestIndices;

	private void rec(int[] xs, int[] ys, int taken, int[] indices, double len, int prev) {
		if (taken == 4) {
			if (best < len) {
				best = len;
				bestIndices = indices.clone();
			}
			return;
		}
		outer:
		for (int i = 0; i < xs.length; i++) {
			for (int j = 0; j < taken; j++) {
				if (indices[j] == i) {
					continue outer;
				}
			}
			indices[taken] = i;
			double dx = 0;
			double dy = 0;
			if (prev >= 0) {
				dx = xs[i] - xs[prev];
				dy = ys[i] - ys[prev];
			}
			rec(xs, ys, taken + 1, indices, len + Math.sqrt(dx*dx + dy*dy), i);
		}
	}

}

class FastScanner {

	private BufferedReader in;
	private StringTokenizer st;

	public FastScanner(InputStream stream) {
		in = new BufferedReader(new InputStreamReader(stream));
	}

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

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

}