(Following question 1) Now instead consider an infinite strip of squares, labeled with the integers 0,1,2, \ldots in that order. You start at the square labeled 0. You want to end up at the square labeled 3. In how many ways can this be done in exactly 15 moves?