1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
import java.util.Arrays;
import java.util.Scanner;
public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int M = sc.nextInt();
        int K = sc.nextInt();
        String[] basic = new String[N];
        int count = 0;
        while(sc.hasNextLine()){
            basic[count] = sc.next();
            count++;
            if(count==N)
                break;
        }
        String[] res = new String[K];
        for(int i=0;i<K;i++){
            int subN = sc.nextInt();
            int subM = sc.nextInt();
            String[] sub = new String[subN];
            count = 0;
            while(sc.hasNextLine()){
                sub[count] = sc.next();
                count++;
                if(count==subN)
                    break;
            }
            res[i] = solution(basic,sub);
        }
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX