문제<\/h2>
Little Lev is learning how to draw letters Q<\/code> and F<\/code>. Initially, he has a white grid of size $n<\/mi>\times<\/mo>m<\/mi><\/mrow>n \times m<\/math><\/span><\/span> n<\/span> <\/span> \times<\/span> <\/span><\/span> <\/span> m<\/span><\/span><\/span><\/span>. Then he will draw several letters of one of the following two shapes:<\/p> [이미지 1]<\/span><\/p> Lev will not rotate or mirror these two shapes. Every time he draws a new letter, he will choose a position for the letter inside the grid and paint all cells of the shape black. Lev will only draw letters in such a way that before drawing all black cells of the letter are white --- that is, he will never paint a cell twice.<\/p> You are given the final coloring of the grid. Count the number of letters Q<\/code> and letters F<\/code> drawn by Lev.<\/p> 입력<\/h2> The first line contains two integers n<\/mi><\/mrow>n<\/math><\/span><\/span> n<\/span><\/span><\/span><\/span> and m<\/mi><\/mrow>m<\/math><\/span><\/span> m<\/span><\/span><\/span><\/span> --- the height and the width of the grid (5<\/mn>\leq<\/mo>n<\/mi>\leq<\/mo>300<\/mn><\/mrow>5 \le n \le 300<\/math><\/span><\/span> 5<\/span> <\/span>$

출력<\/h2>
Print two integers --- the number of letters `Q<\/code> and the number of letters F<\/code> drawn by Lev, respectively.<\/p>`