Levko and Table · Interview Problem

Codeforces

Easy

Matrices

Arrays

Math

Levko and Table

Construct an $n \times n$ table of positive integers whose diagonal sum is exactly $k$ , with all other cells set to $1$.

Acceptance 0%

Start Practice

Problem Statement

You are given two integers $n$ and $k$ . Build an $n \times n$ table of positive integers such that:

the sum of the main diagonal equals exactly $k$ ,
every other cell contains $1$.

If multiple tables are possible, any valid one is acceptable.

This is a straightforward construction problem: the only values you are free to choose are the $n$ diagonal cells, while all non-diagonal cells are fixed to $1$.

Input Format

The first line contains two integers $n$ and $k$ .

Output Format

Print an $n \times n$ table of positive integers.
The sum of the diagonal elements must be exactly $k$ .
All off-diagonal elements must be $1$.

Constraints

$1 \le n$
$k \ge n$
All printed values must be positive integers.

If exact original contest limits are unknown, treat the task as requiring a valid constructive output for arbitrary feasible $n$ and $k$ .

Examples

Sample cases returned by the problem API.

Example 1

Input

3 7

Output

2 1 1
1 2 1
1 1 3

Explanation

The diagonal sum is $2+2+3=7$ , and every non-diagonal cell is $1$.

Premium problem context

Unlock deeper context for this problem

Premium adds guided hints, editorial links, similar variants, discussion resources, and concept maps so you can understand why a problem matters, not just solve it once.

Guided hints

Editorial and discussion links

Concept map and variants

Track your progress