Problem: You are given k sequences of integers. The length of the i-th sequence equals to n_i.

You have to choose exactly two sequences i and j (i ≠ j) such that you can remove exactly one element in each of them in such a way that the sum of the changed sequence i (its length will be equal to n_i - 1) equals to the sum of the changed sequence j (its length will be equal to n_j - 1).

Note that it's required to remove exactly one element in each of the two chosen sequences.

Assume that the sum of the empty (of the length equals 0) sequence is 0.

Input

The first line contains an integer k (2 ≤ k ≤ 2 ⋅ 10^5) — the number of sequences.

Then k pairs of lines follow, each pair containing a sequence.

The first line in the i-th pair contains one integer n_i (1 ≤ n_i < 2 ⋅ 10^5) — the length of the i-th sequence. The second line of the i-th pair contains a sequence of n_i integers a_{i, 1}, a_{i, 2}, ..., a_{i, n_i}.

The elements of sequences are integer numbers from -10^4 to 10^4.

The sum of lengths of all given sequences don't exceed 2 ⋅ 10^5, i.e. n_1 + n_2 + ... + n_k ≤ 2 ⋅ 10^5.

Output

If it is impossible to choose two sequences such that they satisfy given conditions, print "NO" (without quotes). Otherwise in the first line print "YES" (without quotes), in the second line — two integers i, x (1 ≤ i ≤ k, 1 ≤ x ≤ n_i), in the third line — two integers j, y (1 ≤ j ≤ k, 1 ≤ y ≤ n_j). It means that the sum of the elements of the i-th sequence without the element with index x equals to the sum of the elements of the j-th sequence without the element with index y.

Two chosen sequences must be distinct, i.e. i ≠ j. You can print them in any order.

If there are multiple possible answers, print any of them.

Examples

Input

2
5
2 3 1 3 2
6
1 1 2 2 2 1


Output

YES
2 6
1 2


Input

3
1
5
5
1 1 1 1 1
2
2 3


Output

NO


Input

4
6
2 2 2 2 2 2
5
2 2 2 2 2
3
2 2 2
5
2 2 2 2 2


Output

YES
2 2
4 1

Note

In the first example there are two sequences [2, 3, 1, 3, 2] and [1, 1, 2, 2, 2, 1]. You can remove the second element from the first sequence to get [2, 1, 3, 2] and you can remove the sixth element from the second sequence to get [1, 1, 2, 2, 2]. The sums of the both resulting sequences equal to 8, i.e. the sums are equal.

Solution (in JAVA):

Solution:
//    A Computer is Like a mischievous genie.
//    It will give you exactly what you ask for,
//    but not always what you want
//    A code by Rahul Verma


import java.io.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.LinkedList;
import java.util.Queue;
import java.util.StringTokenizer;


public class Main {


    static class Clock {

        protected long start, stop;

        public void start() {
            start = System.currentTimeMillis();
        }

        public void stop() {
            stop = System.currentTimeMillis();
        }

        public String getTime() {
            return ((stop - start) + " ms");
        }
    }


    public static PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));

    static class FastReader {

        BufferedReader br;
        StringTokenizer st;

        public FastReader() {
            br = new BufferedReader(new
                InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        String[] nextSArray() {
            String sr[] = null;
            try {
                sr = br.readLine().trim().split(" ");
            } catch (IOException e) {
                e.printStackTrace();
            }
            return sr;
        }

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }

            return str;
        }
    }


    static long powmodulo(long a, long p) {
        if (p == 0) {
            return 1 % mod;
        }
        if (p == 1) {
            return a % mod;
        }
        long ans = 1;
        while (p > 0) {
            if ((p & 1) > 0) {
                ans = (ans * a) % mod;
            }
            a = (a * a) % mod;
            p = p >> 1;
        }
        return ans % mod;
    }


    static long mod = 1000000007;

    static long gcd(long a, long b) {
        if (a == 0) {
            return b;
        }
        return gcd(b % a, a);
    }

    static long fast_powerNumbers(long a, long n) {
        if (n == 1) {
            return a;
        }
        long ans = fast_powerNumbers(a, n / 2);
        if (n % 2 == 0) {
            return (ans * ans);
        } else {
            return ((ans * ans) * (a));
        }
    }


    static void dfs_helper(int[][] arr, int i, int j, int team, int n, int m) {
        arr[i][j] = team;
        if (i - 1 >= 0 && arr[i - 1][j] == 1) {
            dfs(arr, i - 1, j, team, n, m);
        }
        if (j - 1 >= 0 && arr[i][j - 1] == 1) {
            dfs(arr, i, j - 1, team, n, m);
        }
        if (i + 1 < n && arr[i + 1][j] == 1) {
            dfs(arr, i + 1, j, team, n, m);
        }
        if (j + 1 < m && arr[i][j + 1] == 1) {
            dfs(arr, i, j + 1, team, n, m);
        }

    }

    static void dfs(int[][] arr, int i, int j, int team, int n, int m) {
        dfs_helper(arr, i, j, team, n, m);

    }


    static int arr[];

    static void seive(int n) {
        arr = new int[n + 1];
        arr[0] = arr[1] = 1;
        for (int i = 4; i <= n; i = i + 2) {
            arr[i] = 1;
        }
        for (int i = 3; i * i <= n; i = i + 2) {
            if (arr[i] == 0) {
                for (int j = i * i; j <= n; j = j + i) {
                    arr[j] = 1;
                }

            }
        }


    }


    static int xx, yy;
    static int vis[][];

    public static void bfsm(int x, int y, int n, int m, char ch[][]) {
        vis[x][y] = 0;
        Queue<Pair> qu = new LinkedList<>();
        qu.add(new Pair(x, y));
        while (!qu.isEmpty()) {
            Pair p = qu.poll();
            int i = p.a;
            int j = p.b;
            int xx = vis[i][j] + 1;
            if (i + 1 < n) {
                if (ch[i + 1][j] == '.') {
                    // vis[i+1][j]=Math.min(vis[i+1][j],vis[i][j]+1);
                    if (vis[i + 1][j] > xx) {
                        qu.add(new Pair(i + 1, j));
                        vis[i + 1][j] = xx;
                    }
                }
            }
            if (j + 1 < m) {
                if (ch[i][j + 1] == '.') {
                    //  vis[i][j+1]=Math.min(vis[i][j+1],vis[i][j]+1);
                    if (vis[i][j + 1] > xx) {
                        qu.add(new Pair(i, j + 1));
                        vis[i][j + 1] = xx;
                    }

                }
            }
            if (i - 1 >= 0) {
                if (ch[i - 1][j] == '.') {
                    // vis[i-1][j]=Math.min(vis[i-1][j],vis[i][j]+1);
                    if (vis[i - 1][j] > xx) {
                        qu.add(new Pair(i - 1, j));
                        vis[i - 1][j] = xx;
                    }

                }
            }
            if (j - 1 >= 0) {
                if (ch[i][j - 1] == '.') {
                    // vis[i][j-1]=Math.min(vis[i][j-1],vis[i][j]+1);
                    if (vis[i][j - 1] > xx) {
                        qu.add(new Pair(i, j - 1));
                        vis[i][j - 1] = xx;
                    }

                }
            }
        }
    }

    public static boolean bfs(int x, int y, int n, int m, char ch[][]) {
        vis[x][y] = 0;
        Queue<Pair> qu = new LinkedList<>();
        qu.add(new Pair(x, y));
        while (!qu.isEmpty()) {
            Pair p = qu.poll();
            int i = p.a;
            int j = p.b;
            if (i + 1 < n) {
                if (ch[i + 1][j] == '.') {
                    if (vis[i][j] + 1 < vis[i + 1][j]) {
                        vis[i + 1][j] = vis[i][j] + 1;

                        if (i + 1 == n - 1) {
                            xx = i + 1;
                            ch[i + 1][j] = 'D';
                            yy = j;
                            return true;
                        }
                        ch[i + 1][j] = 'D';
                        qu.add(new Pair(i + 1, j));
                    }
                }
            }
            if (j + 1 < m) {
                if (ch[i][j + 1] == '.') {
                    if (vis[i][j] + 1 < vis[i][j + 1]) {
                        vis[i][j + 1] = vis[i][j] + 1;
                        if (j + 1 == m - 1) {
                            xx = i;
                            yy = j + 1;
                            ch[i][j + 1] = 'R';
                            return true;
                        }
                        ch[i][j + 1] = 'R';
                        qu.add(new Pair(i, j + 1));
                    }
                }
            }
            if (i - 1 >= 0) {
                if (ch[i - 1][j] == '.') {
                    if (vis[i][j] + 1 < vis[i - 1][j]) {
                        vis[i - 1][j] = vis[i][j] + 1;
                        if (i - 1 == 0) {
                            xx = i - 1;
                            yy = j;
                            ch[i - 1][j] = 'U';
                            return true;
                        }
                        ch[i - 1][j] = 'U';
                        qu.add(new Pair(i - 1, j));
                    }
                }
            }
            if (j - 1 >= 0) {
                if (ch[i][j - 1] == '.') {

                    if (vis[i][j] + 1 < vis[i][j - 1]) {
                        vis[i][j - 1] = vis[i][j] + 1;
                        if (j - 1 == 0) {
                            yy = j - 1;
                            xx = i;
                            ch[i][j - 1] = 'L';
                            return true;
                        }
                        ch[i][j - 1] = 'L';
                        qu.add(new Pair(i, j - 1));
                    }
                }
            }
        }
        return false;
    }


    public static void main(String[] args) throws Exception {
        FastReader sc = new FastReader();

        Clock clock = new Clock();
        clock.start();

        int k=sc.nextInt();
        boolean ans=false;
        int i1=-1,i2=-1,s1=-1,s2=-1;
        HashMap<Long,Pair>hm=new HashMap<>();
        for (int i = 0; i <k ; i++) {
            int n=sc.nextInt();
            long sum=0;
            long arr[]=new long[n];
            for (int j = 0; j <n ; j++) {
                arr[j]=sc.nextLong();
                sum+=arr[j];
            }
            for (int j = 0; j <n ; j++) {
                long ele = sum-arr[j];
                if(hm.containsKey(ele))
                {
                    if(i+1==hm.get(ele).a)
                        {
                           // System.out.println("ss");
                            continue;
                        }
                    s1 = hm.get(ele).a;
                    i1 = hm.get(ele).b;
                    s2 = i+1;
                    i2 = j+1;
                    ans=true;
                    break;
                }
                else
                {
                    hm.put(ele,new Pair(i+1,j+1));
                }

                //System.out.println(hm);
            }
            if(ans)
                break;
        }

        if (ans) {
            System.out.println("YES");
            System.out.println(s1 + " " + i1);
            System.out.println(s2 + " " + i2);
        } else {
            System.out.println("NO");
        }
    }
}


class Pair {

    int a;
    int b;

    Pair(int a, int b) {
        this.a = a;
        this.b = b;
    }
}


class Graph {

    HashMap<Integer, ArrayList<Integer>> hm;

    Graph() {
        hm = new HashMap<>();
    }

    Graph(int n) {

        hm = new HashMap<>();
        for (int i = 0; i < n; i++) {
            hm.put(i, new ArrayList<Integer>());
        }
    }

    // function for adding an edge.................................................
    public void addEdge(int a, int b, boolean isDir) {
        if (isDir) {
            if (hm.containsKey(a)) {
                hm.get(a).add(b);
            } else {
                hm.put(a, new ArrayList<>(Arrays.asList(b)));
            }
        } else {
            if (hm.containsKey(a)) {
                hm.get(a).add(b);
            } else if (!hm.containsKey(a)) {
                hm.put(a, new ArrayList<>(Arrays.asList(b)));
            }

            if (hm.containsKey(b)) {
                hm.get(b).add(a);
            } else if (!hm.containsKey(b)) {
                hm.put(b, new ArrayList<>(Arrays.asList(a)));
            }
        }
    }


}


class DSU {

    int parent[], rank[];

    DSU(int n) {
        parent = new int[n];
        rank = new int[n];
        for (int i = 0; i < n; i++) {
            parent[i] = -1;
            rank[i] = 1;
        }
    }

    int find(int s1) {
        if (parent[s1] == -1) {
            return s1;
        }

        parent[s1] = find(parent[s1]);
        return parent[s1];
    }

    void unite(int s1, int s2) {
        int p1 = find(s1);
        int p2 = find(s2);

        if (p1 != p2) {
            if (rank[p1] > rank[p2]) {
                parent[p2] = find(p1);
                rank[p1] += rank[p2];
            } else {
                parent[p1] = find(p2);
                rank[p2] += rank[p1];
            }
        }
    }
}

// out.println(al.toString().replaceAll("[\\[|\\]|,]",""));