Problem: Write a function to determine if it's possible to make a single vertical cut through a rectangular cake with non-overlapping toppings such that:

The cut does not intersect or destroy any of the toppings.
After the cut, both resulting pieces of the cake each contain at least one topping.

List of toppings with their positions [topping (start_x, end_x, start_y, end_y) ]
Output:
True/False
Example:
Input :
a (0,6,0, 1); b (7,8,0,4); c(0, 1,2,4) ;

Explanation:
012345678
0 aaaaaaabb
1 aaaaaaabb
2 cc.........bb
3 cc.........bb
4 cc.........bb

It can cut between column 6 and 7 vertically, After the cut, the left piece has topping a, c; right piece has topping b.