Given an array A of **N** integers, Your task is to complete the function **find3Numbers** which finds any 3 elements in it such that A[i] < A[j] < A[k] and i < j < k. You need to return them as a vector, if no such element is present then return the empty vector of size 0.

**Input:**

The first line of input contains an integer T denoting the no of test cases. Then T test cases follow. The first line of each test case contains an integer N denoting the size of the array A in the next line are N space separated values of the array A.

**Output:**

For each test case in a new line output will be 1 if the sub-sequence returned by the function is present in array A else 0.

**Constraints:**

1<=T<=100

1<=N<=100

1<=A[ ] <=1000

**Example:
Input:**

2

5

1 2 1 1 3

3

1 1 3

1

0

There are 2 test cases

a sub-sequence 1 2 3 exist

no such sub-sequence exist

All Is Well | 148 |

ioan | 123 |

praveen2809 | 114 |

Diplav Srivastava | 105 |

Srinivas Chakravarth | 91 |

Lam Ngoc Pham | 405 |

Divvya Sinha | 352 |

All Is Well | 337 |

skull tone | 310 |

KM SUNITA | 301 |

akhayrutdinov | 3798 |

sanjay05 | 3366 |

Jasleen Kaur 2 | 2012 |

Michael Riegger | 2001 |

Quandray | 1931 |