Ribbon (Easy)

Interview

Time limit1sMemory limit1024 MB

Summary

Given N ribbons with positions, lengths, and colors, find two ribbons of different colors that can be tied together, or report NO.

Level: Easy2 of 10
Topics: Brute force, Implementation
Solved: No attempts yet

Problem

You are given $N$ ribbons tied to points on a number line. The $i$ -th ribbon $(1 \le i \le N)$ is tied to the point $X_i$ and has length $L_i$ . Its color is $C_i$ , which is one of R, Y, or B, meaning red, yellow, and blue.

You want to tie a knot between two ribbons. The ribbons are not elastic, so you cannot stretch them, but you can bend them. That means you can tie a knot between the $i$ -th and $j$ -th ribbons if $|X_i - X_j| \le L_i + L_j$ $(i \ne j)$ . Assume the ribbons are lines with no area, and ignore the length of the knot. A knot is called beautiful when the two ribbons have different colors, that is, $C_i \ne C_j$ .

Write a program that finds two ribbon numbers that can be tied into a beautiful knot.

Input

The first line contains an integer $N$ .

The second line contains $N$ integers $X_1, X_2, \cdots, X_N$ .

The third line contains $N$ integers $L_1, L_2, \cdots, L_N$ .

The fourth line contains $N$ characters $C_1, C_2, \cdots, C_N$ .

Output

If a valid pair exists, print YES on the first line. Otherwise, print NO.

If a valid pair exists, print the numbers of two ribbons that can be tied into a beautiful knot on the second line.

If several answers exist, you may print any of them.

Constraints

$2 \le N \le 10^3$
$-10^9 \le X_1 < X_2 < \cdots < X_N \le 10^9$
$1 \le L_i \le 10^9$
$C_i$ is one of R, Y, B.

Examples2

Example 1
Input
```
2
1 3
1 1
Y R
```
Expected output
```
YES
1 2
```
Example 2
Input
```
2
-4 1
1 2
B B
```
Expected output
```
NO
```