Very easy

Execution time limit is 0.1 seconds

Runtime memory usage limit is 16 megabytes

Cat Vasil learned that a neighbor Dima living from it after a number of fences bred mice. Since his farm all the mice he has long been caught, the cat goes on the hunt for the mice to a neighbor, crawling through a hole in the fence. At each site, Vasil, as any cat bred, moved on already laid there trails. In the village of Old Vasyuki, where Vasil, just one street and that stretches along the river, so the cottages are located only on one side of the street. It is known that between any two adjacent areas in the fence is exactly one hole. How many ways Vasil can get to the site of Dima, if you know that Dima live in the area under the number k, and Vasil himself lives in the area under the number m?

In a single line are separated by spaces, first the number of houses in the village of n, then the number of area Vasil m, plot number Dima k, and then n numbers indicating the number of paths that lead either to the hole in the fence or from the hole in the fence, or between the holes in the fence neighbors i and i+1. All input data are natural numbers not exceeding 10.

Single number - the number of different ways to Vasil to get to the desired area for hunting.

Input #1

Answer #1