[백준] 14425번 문자열 집합 문제! (silver 3

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.HashMap;
import java.util.StringTokenizer;
public class Main{
	public static void main(String[] args) throws IOException {
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		BufferedWriter bw=new BufferedWriter(new OutputStreamWriter(System.out));
		HashMap<String,String> map=new HashMap<>();
		StringTokenizer st=new StringTokenizer(br.readLine());
		int n=Integer.parseInt(st.nextToken());
		int m=Integer.parseInt(st.nextToken());
		for(int i=0; i<n; i++ ) {
			map.put(br.readLine(), "1");
		}
		int sum=0;
		for(int i=0; i<m; i++) {
			if(map.get(br.readLine())=="1") {
				sum+=1;
			}
		}
		bw.write(sum+"");
		bw.flush();
	}
}