### Problem link:

### PREREQUISITES:

Adhoc

### PROBLEM:

In this problem we are given a birthday cake with its height being **H** and width being **W**. Left end of the cake is placed at x=0 and the right end is placed at x=**W**.Also we are given **F** cuts we need to make in this cake.The i^{th} cut should be made at Pi.We need to find the the area of the smallest piece.

### EXPLANATION:

This is the easiest problem of the set. It is a very straightforward problem.Include x=0 and x=**W** in the list of cuts **P**.Then we need to sort this list of cuts.The area of the smallest piece will be **min(P _{i} -P _{i-1}) * H** where i ≥ 1. Note that in calculating this minimum value,

**P**should be the sorted list.This was the only tricky thing in this problem.