Školjka

%V0 Let $K$ and $L$ be positive integers. On a board consisting of $2K \times 2L$ unit squares an ant starts in the lower left corner square and walks to the upper right corner square. In each step it goes horizontally or vertically to a neighbourning square. It never visits a square twice. At the end some squares may remain unvisited. In some cases the collection of all unvisited squares forms a single rectangle. In such cases, we call this rectangle [i]MEMOrable[/i]. Determine the number of different MEMOrable rectangles. [i]Remark. Rectangles are different unless they consist of exactly the same squares.[/i]