public int findFirstGE(int[] nums, int target) {
    int left = 0, right = nums.length - 1;
    while(left <= right) {
        int mid = left + (right - left)/2;
        if(nums[mid] >= target) right = mid -1;
        else left = mid +1;
    }
    return left;
}

public int findFirstGE(int[] nums, int target) {
    int left = 0, right = nums.length - 1;
    while(left < right) {
        int mid = left + (right - left)/2;
        if(nums[mid] >= target) right = mid;
        else left = mid +1;
    }
    return left;
}

public int findFirstGE(int[] nums, int target) {
    int left = 0, right = nums.length -1;
    int ans = -1;
    while(left <= right) {
        int mid = left + (right - left)/2;
        if(nums[mid] == target) {
            ans = mid;
            left = mid +1;
        } else if(nums[mid] < target) left = mid +1;
        else right = mid -1;
    }
    return ans;
}

public int findFirstGE(int[] nums, int target) {
    int left =0, right = nums.length -1;
    while(left < right) {
        int mid = left + (right - left +1)/2;
        if(nums[mid] >= target) left = mid;
        else right = mid -1;
    }
    return left;
}