1.Add each two values of the first two arrays and insert the value into a map. O(n^2).

2.Find if there is a value in the third array matches with the map.O(2n).

Code:

public void findvalue(int[] a,int[] b,int[] c,int value){
Map<Integer,Integer> map = new HashMap<>();
for (int i=0;i<a.length;i++){
for (int j=0;j<b.length;j++){
int sum = a[i]+b[j];
map.put(sum, 1);
}
}
int result = 0;
for (int i=0;i<c.length;i++){
int define = map.getOrDefault(value-c[i], 0);
if (define==1) {
result = 1;
break;
}
}
if (result == 1) {
System.out.println("There exist such triple numbers.");
} else {
System.out.println("No such triple numbers be found.");

}
}

The time complexity would be O(n^2).