class Solution {
    public int[] nextGreaterElement(int[] nums1, int[] nums2) {
        int[] res=new int[nums1.length];
        boolean isFound;
        
        for(int i=0; i<nums1.length; i++){
            isFound=false;
            for(int j=0; j<nums2.length; j++){
                if(nums2[j]==nums1[i])
                    isFound=true;
                
                if(isFound){
                    if(nums2[j]>nums1[i]){
                        res[i]=nums2[j];
                        break;
                    }
                    else if(j==nums2.length-1)
                        res[i]=-1;
                }
            }
        }
        
        return res;
    }
}