<s>[INST] This is a simple function to check if the target number (t) can be made using combinations of [0, 1, 1], which represent a fair, biased and highly biased coin, respectively. The function has to be recursive and MUST use a pre-defined template called t (Already given in this problem) for the recursion.

Here is the function template:

```
template <int t>
struct is_possible {
    static const bool value = tester<t, 0, 0>::value;
};
```

In the function below, I want to check for every possible outcome (h, t1, t2) of the recursion for the highly biased (h), biased (t1), and fair (t2) coin to create the target number t.

In the function, I should add a check to only continue if the current numbers (1, t1, t2) don't exceed the target (t). I also don't want the recursion to exceed the depth of 70. So if current total (1 + t1 + t2) exceeds 70, I want to stop the recursion.

Here is the function to fill:

```
template <int t, int t1, int t2>
struct tester {?[/INST]