**Compilation/Execution Result:**

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

Author: Shubham Joshi 1

surbhi_7 | 128 |

Rajat Thakur 2 | 115 |

John Carey | 92 |

shaktiman_shaktiman_shaktiman | 91 |

nancygarg258_pec | 90 |

Ibrahim Nash | 604 |

ashrepos | 490 |

RealHorror | 368 |

shaktiman_shaktiman_shaktiman | 363 |

shi143din | 343 |

akhayrutdinov | 4052 |

sanjay05 | 3406 |

Quandray | 2435 |

Michael Riegger | 2228 |

Jasleen Kaur 2 | 2012 |