Editing 2015 Feb Bronze Problem 3 Cow Hopscotch (Bronze) (section)

== Problem ==

In this problem, Bessie the cow is playing a variant of the classic game "hopscotch" on a grid of squares (R x C, where R is the number of rows and C is the number of columns). Starting from the top-left square, Bessie hops in a two-dimensional way, moving downwards towards the bottom-right square. Each move Bessie makes must be strictly downwards and to the right.

Bessie wants to make the game more interesting, so she decides that she will only make a hop to a square if it has a different number than the square she is currently standing on. She wonders in how many ways she can reach the bottom-right square.

Each of the R*C squares has a number in the range of 1…K, where K (1 ≤ K ≤ 100) is the total number of different numbers a square can have. The input guarantees that Bessie can reach the bottom-right square.

Write a program to determine the number of ways Bessie can reach the bottom-right square.