n+m−1 unit squares are arranged in L-shape whose one side contains n squares and the other side contains m squares. Ayse and Betul plays a turn based game with following rules: Ayse plays first. At each move, the player captures desired number of adjacent squares in same side of L. The one who captures the last square loses the game. If four games are played for pairs (n,m)=(2003,2003), (2002,2003), (2003,3), (2001,2003); how many times can Ayse guarantee to win?<spanclass=′latex−bold′>(A)</span>0<spanclass=′latex−bold′>(B)</span>1<spanclass=′latex−bold′>(C)</span>2<spanclass=′latex−bold′>(D)</span>3<spanclass=′latex−bold′>(E)</span>4