Problem

Source: Tuymaada Junior 2001 p2

Tags: infinite chessboard, number theory, Sum, divisible



Is it possible to arrange integers in the cells of the infinite chechered sheet so that every integer appears at least in one cell, and the sum of any $10$ numbers in a row vertically or horizontal, would be divisible by $101$?