第九届ACM山东省省赛 H 题 - Dominoes ( BFS )

欢迎访问https://blog.csdn.net/lxt_Lucia～～

宇宙第一小仙女\(^o^)/～萌量爆表求带飞=≡Σ((( つ^o^)つ~ dalao们点个关注呗～

 

--------------------------------我只是一条可爱哒分界线-------------------------------

 

一、问题：

Description

Orz likes to play dominoes. Now giving an n∗mn∗m chessboard and kk dominoes whose size are 1∗21∗2, Orz finds that there is exactly one grid empty, so that he can move dominoes without overlapping them. An initial situation is given, he wants to know how many final situation could be achieved, except the initial situation. Note every domino is different, as they have their own serial number. Since the answer may be very large, please output the answer modulo 1000000009. 

 

Input

There will be multiple test cases. For each test case:
The first line contains three integers: n,m,k(n≤9,m≤10000)n,m,k(n≤9,m≤10000).
The following kk lines, each line contains four integers: a   b  c  d, indicating that this domino occupies (a, b) and (c, d). 
The input guarantees that the domino does not overlap, and there is exactly one empty grid.

 

Output

For each test cases, output the answer modulo 10000000091000000009.

 <