Problem:
Score : 800 points

Problem Statement

Takahashi is doing a research on sets of points in a plane.
Takahashi thinks a set S of points in a coordinate plane is a good set when S satisfies both of the following conditions:

The distance between any two points in S is not \sqrt{D_1}.

The distance between any two points in S is not \sqrt{D_2}.

Here, D_1 and D_2 are positive integer constants that Takahashi specified.

Let X be a set of points (i,j) on a coordinate plane where i and j are integers and satisfy 0 ≤ i,j < 2N.

Takahashi has proved that, for any choice of D_1 and D_2, there exists a way to choose N^2 points from X so that the chosen points form a good set.
However, he does not know the specific way to choose such points to form a good set.
Find a subset of X whose size is N^2 that forms a good set.

Constraints

1 ≤ N ≤ 300

1 ≤ D_1 ≤ 2×10^5

1 ≤ D_2 ≤ 2×10^5

All values in the input are integers.

Input

Input is given from Standard Input in the following format:

N D_1 D_2

Output

Print N^2 distinct points that satisfy the condition in the following format:

x_1 y_1
x_2 y_2
:
x_{N^2} y_{N^2}

Here, (x_i,y_i) represents the i-th chosen point.
0 ≤ x_i,y_i < 2N must hold, and they must be integers.
The chosen points may be printed in any order.
In case there are multiple possible solutions, you can output any.

Sample Input 1

2 1 2

Sample Output 1

0 0
0 2
2 0
2 2

Among these points, the distance between 2 points is either 2 or 2\sqrt{2}, thus it satisfies the condition.

Sample Input 2

3 1 5

Sample Output 2

0 0
0 2
0 4
1 1
1 3
1 5
2 0
2 2
2 4

Solution in C# (Mono 4.6.2.0) (judge verdict: Wrong Answer)

using System;
using System.Collections.Generic;
using System.Linq;

namespace AGC025D
{
    internal class Program
    {
        public static void Main(string[] args)
        {
            long[] input = Array.ConvertAll(Console.ReadLine().Split(' '), long.Parse);
            long N = input[0];
            long n = N * 2;
            Distance d1 = new Distance(input[1]);
            Distance d2 = new Distance(input[2]);
            List<Pair> pairs = d1.P;
            pairs.AddRange(d2.P);

            Point[] ps = new Point[n * n];
            for (long i = 0; i < n; i++)
            {
                for (long j = 0; j < n; j++)
                {
                    ps[i * n + j] = new Point(i, j);
                }
            }

            for (long i = 0; i < n; i++)
            {
                for (long j = 0; j < n; j++)
                {
                    if (!ps[i * n + j].Can)
                    {
                        continue;
                    }

                    pairs.ForEach(pair =>
                    {
                        long ii;
                        long jj;
                        ii = i + pair.A;
                        jj = j + pair.B;
                        if (ii < n && jj < n) ps[ii * n + jj].Can = false;

                        ii = i + pair.B;
                        jj = j + pair.A;
                        if (ii < n && jj < n) ps[ii * n + jj].Can = false;

                        ii = i + pair.A;
                        jj = j - pair.B;
                        if (ii < n && jj >= 0) ps[ii * n + jj].Can = false;

                        ii = i + pair.B;
                        jj = j - pair.A;
                        if (ii < n && jj >= 0) ps[ii * n + jj].Can = false;

                        ii = i - pair.A;
                        jj = j + pair.B;
                        if (ii >= 0 && jj < n) ps[ii * n + jj].Can = false;

                        ii = i - pair.B;
                        jj = j + pair.A;
                        if (ii >= 0 && jj < n) ps[ii * n + jj].Can = false;

                        ii = i - pair.A;
                        jj = j - pair.B;
                        if (ii >= 0 && jj >= 0) ps[ii * n + jj].Can = false;

                        ii = i - pair.B;
                        jj = j - pair.A;
                        if (ii >= 0 && jj >= 0) ps[ii * n + jj].Can = false;
                    });
                }
            }

            Point[] ans = ps.Where(p => p.Can).ToArray();
            long nn = N * N;
            if (ans.Length < nn) return;
            for (long i = 0; i < nn; i++)
            {
                ans[i].Show();
            }
        }
    }

    class Distance
    {
        public long D;
        public List<Pair> P;

        public Distance(long d)
        {
            D = d;
            P = new List<Pair>();
            Search();
        }

        private void Search()
        {
            double droot = Math.Sqrt(D);
            for (long i = 0; i <= droot; i++)
            {
                for (long j = i; j <= droot; j++)
                {
                    long l = i * i + j * j;
                    if (l == D)
                    {
                        P.Add(new Pair(i, j));
                    }

                    if (l > D)
                    {
                        break;
                    }
                }
            }
        }
    }

    class Pair
    {
        public long A;
        public long B;

        public Pair(long a, long b)
        {
            A = a;
            B = b;
        }
    }

    class Point
    {
        public long X;
        public long Y;
        public bool Can;

        public Point(long i, long j)
        {
            Can = true;
            X = i;
            Y = j;
        }

        public void Show()
        {
            Console.WriteLine("" + X + " " + Y);
        }
    }
}