Find all pairs $(n,m)$ $m\geq n \geq 3$ , for which exist such table $n\times m$ with numbers in every cell, and sum of numbers in every $2\times 2$ is negative and sum of numbers in every $3\times 3$ is positive.
1. **Show that the table doesn't contain a sub-table of $4 \times 4$.**

   Suppose there exists a $4 \times 4$ sub-table within the $n \times m$ table. Let's denote the elements of this $4 \times 4$ sub-table as follows:
   \[
   \begin{array}{cccc}
   a_{11} & a_{12} & a_{13} & a_{14} \\
   a_{21} & a_{22} & a_{23} & a_{24} \\
   a_{31} & a_{32} & a_{33} & a_{34} \\
   a_{41} & a_{42} & a_{43} & a_{44} \\
   \end{array}
   \]
   Consider the sum of all $2 \times 2$ sub-tables within this $4 \times 4$ sub-table. Each $2 \times 2$ sub-table sum is negative by the problem's condition. There are 9 such $2 \times 2$ sub-tables in a $3 \times 3$ sub-table, and 16 such $2 \times 2$ sub-tables in a $4 \times 4$ sub-table.

   If we sum all the $2 \times 2$ sub-tables in the $4 \times 4$ sub-table, each element in the $4 \times 4$ sub-table will be counted multiple times. Specifically, each element in the interior $2 \times 2$ sub-table (i.e., $a_{22}, a_{23}, a_{32}, a_{33}$) will be counted 4 times, each element on the edge but not a corner (i.e., $a_{12}, a_{13}, a_{21}, a_{24}, a_{31}, a_{34}, a_{42}, a_{43}$) will be counted 3 times, and each corner element (i.e., $a_{11}, a_{14}, a_{41}, a_{44}$) will be counted 2 times.

   Therefore, the sum of all $2 \times 2$ sub-tables in the $4 \times 4$ sub-table is:
   \[
   4(a_{22} + a_{23} + a_{32} + a_{33}) + 3(a_{12} + a_{13} + a_{21} + a_{24} + a_{31} + a_{34} + a_{42} + a_{43}) + 2(a_{11} + a_{14} + a_{41} + a_{44})
   \]
   Since each $2 \times 2$ sub-table sum is negative, the total sum must be negative. However, this contradicts the condition that the sum of numbers in every $3 \times 3$ sub-table is positive. Therefore, a $4 \times 4$ sub-table cannot exist.

2. **Show that for $(n,m) = (3,m)$ we have an example.**

   Consider a $3 \times m$ table. We need to ensure that the sum of numbers in every $2 \times 2$ sub-table is negative and the sum of numbers in every $3 \times 3$ sub-table is positive.

   Let's construct a $3 \times m$ table with the following pattern:
   \[
   \begin{array}{ccc}
   -1 & -1 & 3 \\
   -1 & -1 & 3 \\
   3 & 3 & -1 \\
   \end{array}
   \]
   For $m > 3$, we can repeat the pattern horizontally.

   - The sum of any $2 \times 2$ sub-table is:
     \[
     \begin{array}{cc}
     -1 & -1 \\
     -1 & -1 \\
     \end{array}
     \quad \text{or} \quad
     \begin{array}{cc}
     -1 & 3 \\
     3 & -1 \\
     \end{array}
     \]
     Both sums are negative.

   - The sum of any $3 \times 3$ sub-table is:
     \[
     \begin{array}{ccc}
     -1 & -1 & 3 \\
     -1 & -1 & 3 \\
     3 & 3 & -1 \\
     \end{array}
     \]
     The sum is $-1 -1 + 3 -1 -1 + 3 + 3 + 3 -1 = 7$, which is positive.

   Therefore, the table satisfies the conditions for $(n,m) = (3,m)$ with $m \geq 3$.

The final answer is $\boxed{(3,m), m \ge 3}$