write a go solution for Description:
There are n uniform random real variables between 0 and 1, inclusive, which are denoted as x_1,x_2,ldots,x_n.

Tenzing has m conditions. Each condition has the form of x_i+x_j<=1 or x_i+x_j>=1.

Tenzing wants to know the probability that all the conditions are satisfied, modulo 998~244~353.

Formally, let M=998~244~353. It can be shown that the answer can be expressed as an irreducible fraction p/q, where p and q are integers and qnotequiv0pmodM. Output the integer equal to p*q^-1bmodM. In other words, output the integer x that 0<=x<M and x*qequivppmodM.

Input Format:
The first line contains two integers n and m (1<=n<=20, 0<=m<=n^2+n).

Then following m lines of input contains three integers t, i and j (tin0,1, 1<=i<=j<=n).

- If t=0, the condition is x_i+x_j<=1.
- If t=1, the condition is x_i+x_j>=1.

It is guaranteed that all conditions are pairwise distinct.

Output Format:
Output the probability that all the conditions are satisfied, modulo M=998~244~353.

Note:
In the first test case, the conditions are x_1+x_2<=1 and x_3+x_3>=1, and the probability that each condition is satisfied is frac12, so the probability that they are both satisfied is frac12*frac12=frac14, modulo 998~244~353 is equal to 748683265.

In the second test case, the answer is frac14.

In the third test case, the answer is frac116.

In the fourth test case, the sum of all variables must equal 2, so the probability is 0.. Output only the code with no comments, explanation, or additional text.