영어 원문입니다. 원문의 수식·표를 글자로 옮겨 모양이 다를 수 있습니다. 정확한 내용은 원문 페이지에서 확인하세요. 원문 페이지 열기 (새 창)
시간 제한 1초 · 메모리 제한 512 MB
Problem
You are given n · (m+1) coefficients a_{i,j} and b_i which form the following n linear equations:
- a_{1,1}x_1 + a_{1,2}x_2 + … + a_{1,m}x_m = b_1 (mod 10^9 + 7)
- a_{2,1}x_1 + a_{2,2}x_2 + … + a_{2,m}x_m = b_2 (mod 10^9 + 7)
- …
- a_{n,1}x_1 + a_{n,2}x_2 + … + a_{n,m}x_m = b_n (mod 10^9 + 7)
Your task is to find any m integers x_1, x_2, …, x_m that satisfy the given equations.
Input
The first line has two integers n and m: the number of equations and variables.
The next n lines each have m+1 integers a_{i,1}, a_{i,2}, …, a_{i,m}, b_i: the coefficients of the i-th equation.
Output
Print m integers x_1, x_2,…, x_m: the values of the variables that satisfy the equations. The values must also satisfy 0 ≤ x_i < 10^9 + 7. You can print any valid solution. If no solution exists print only -1.
Constraints
- 1 ≤ n, m ≤ 500
- 0 ≤ a_{i,j}, b_i < 10^9 + 7
예제
예제 1
3 3 2 0 1 7 1 2 0 0 1 3 1 2
2 1000000006 3