Formulate a continuous variant of the following problem:
```
NAME_1 has three plates in front of him. The giant has $N$ beans that he distributes to the three plates. All the beans look the same, but one of them is a magic bean. NAME_1 doesn't know which one it is, but the giant knows. NAME_1 can ask the giant questions of the form: "Does this subset of the beans contain the magic bean?" In each question NAME_1 may choose any subset of beans from a single plate, and the giant will respond truthfully.
If the three plates contain $a$, $b$ and $c$ beans respectively, we let $h(a, b, c)$ be the minimal number of questions NAME_1 needs to ask in order to guarantee he locates the magic bean. For example, $h(1, 2, 3) = 3$ and $h(2, 3, 3) = 4$. Give an algorithm to compute $h(a, b, c)$ given non-negative integers $a, b, c$.
```