B'You are given n pairwise non-collinear two-dimensional vectors. You can make shapes in the two-dimensional plane with these vectors in the following fashion: You can reuse a vector as many times as you want. Count the number of different, non-degenerate (with an area greater than 0 ) and convex shapes made from applying the steps, such that the shape can be contained within a m x m square, and the vectors building the shape are in counter-clockwise fashion. Since this number can be too large, you should calculate it by modulo 998244353 . Two shapes are considered the same if there exists some parallel translation of the first shape to another. A shape can be contained within a m x m square if there exists some parallel translation of this shape so that every point (u, v) inside or on the border of the shape satisfies 0 <= q u, v <= q m . The first line contains two integers n and m -- the number of vectors and the size of the square ( 1 <= q n <= q 5 , 1 <= q m <= q 10^9 ). Each of the next n lines contains two integers x_i and y_i -- the x -coordinate and y -coordinate of the i -th vector ( |x_i|, |y_i| <= q 4 , (x_i, y_i) neq (0, 0) ). It is guaranteed, that no two vectors are parallel, so for any two indices i and j such that 1 <= q i < j <= q n , there is no real value k such that x_i cdot k = x_j and y_i cdot k = y_j . Output a single integer -- the number of satisfiable shapes by modulo 998244353 . The shapes for the first sample are: The only shape for the second sample is: The only shape for the fourth sample is: '...