## Matrix

Statement

## Goal

You are given a number`N`which defines the number of Arrays and a number

`L`which defines the length of these Arrays, return

`N`arrays of length

`L`, filled from 1 to

`N`*

`L`.

Input

**Line 1:**An integer

`L`for the length of each array

**Line 2:**An integer

`N`for the number of arrays

Output

**An array of length**

`N`lines:`L`

Constraints

Example

Input

2 4

Output

[1,2] [3,4] [5,6] [7,8]

Game modes

FastestShortestReverse

Test cases

Test 1 Test

Input

2
4

Output

[1,2]
[3,4]
[5,6]
[7,8]

Validator 1 Validator

Input

2
5

Output

[1,2]
[3,4]
[5,6]
[7,8]
[9,10]

Test 2 Test

Input

9
2

Output

[1,2,3,4,5,6,7,8,9]
[10,11,12,13,14,15,16,17,18]

Validator 2 Validator

Input

9
3

Output

[1,2,3,4,5,6,7,8,9]
[10,11,12,13,14,15,16,17,18]
[19,20,21,22,23,24,25,26,27]

Test 3 Test

Input

10
5

Output

[1,2,3,4,5,6,7,8,9,10]
[11,12,13,14,15,16,17,18,19,20]
[21,22,23,24,25,26,27,28,29,30]
[31,32,33,34,35,36,37,38,39,40]
[41,42,43,44,45,46,47,48,49,50]

Validator 3 Validator

Input

1
5

Output

[1]
[2]
[3]
[4]
[5]

Test 4 Test

Input

5
1

Output

[1,2,3,4,5]

Validator 4 Validator

Input

5
2

Output

[1,2,3,4,5]
[6,7,8,9,10]

Solution language

Solution

Stub generator input