Algorithms and Data Structures

  • Profound Academy

    • Status
      • 1
        Implementation
      • 2
        Bitwise operations
      • 3
        Prefix Sums
      • 4
        Sliding window / Two pointers
      • 5
        Modular Arithmetic
      • 6
        Number Theory
      • 7
        Binary Search
      • 8
        Basic Sorting
      • 9
        Greedy Algorithms
      • 10
        Basic Dynamic Programming
      • 11
        Recursion
      • 12
        Linked LIst
      • 13
        Queue & Stack
      • 14
        Binary tree + BST
      • 15
        Divide & Conquer + Advanced Sorting
      • 16
        Heap
      • 17
        Hashing
      • 18
        Graph Representation

    • Restore the matrix

    The magical world of has now upgraded and stores in information in 2D prefix sum arrays. This helps them move faster and saves a lot of time. Yet, as usual, they sometimes lose the initial arrays and get stuck. Can you help them restore the initial 2D array from a given 2D prefix sum matrix?

    Input

    The first line of the input contains two integers - the number of rows in the matrix r and the number of columns c (1 ≤ r, c ≤ 1000).
    The next r lines contain c integers separated by a space, that represent the elements in the prefix sum matrix .

    Output

    The program should print r lines containing c numbers representing the initial matrix.

    Examples

    Input
    Output
    3 5 1 3 0 4 10 0 5 10 18 24 0 6 9 17 28
    1 2 -3 4 6 -1 3 8 4 0 0 1 -2 0 5
     

    Constraints

    Time limit: 2 seconds

    Memory limit: 512 MB

    Output limit: 15 MB

    To check your solution you need to sign in
    Sign in to continue