import java.io.IOException;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Scanner;
import java.util.TreeMap;
import java.util.Vector;



public class Main{

	public static class pair implements Comparable<pair> {
		int id;
		int ans;
 
		pair(int x, int y) {
 
			id = x;
			ans = y;
 
		}
 
		public pair() {
 
		}
 
		public int compareTo(pair o) {
			// TODO Auto-generated method stub
 
			return this.id - o.id;
		}
	}
 
//	static int mod = (int) 998244353.;
	static ArrayList<Integer> gr[];
	static int[] ar;
	static Scanner sc = new Scanner(System.in);
	static int pri[] = new int[(int) 1e6 + 5];
	static StringBuilder out = new StringBuilder();
 
	//static long dp[];
 
	public static void main(String[] args) throws IOException {
		int t =1;// sc.nextInt();
		
		while (t-- > 0) {

			int n=sc.nextInt();
			int k=sc.nextInt();
			gr=new ArrayList[n+1];
			for(int i=0;i<=n;i++) {
				gr[i]=new ArrayList<Integer>();
			}
			
			for(int i=0;i<k;i++) {
				int di=sc.nextInt();
				for(int j=0;j<di;j++) {
					int in=sc.nextInt();
					gr[in].add(i);
				}
			}
			int cnt=0;
			for(int i=1;i<=n;i++) {
				if(gr[i].size()==0)cnt++;
			}
			System.out.println(cnt);
		}
	}
} import java.io.IOException; IOException java.io import java.util.ArrayList; ArrayList java.util import java.util.Arrays; Arrays java.util import java.util.Collections; Collections java.util import java.util.HashMap; HashMap java.util import java.util.HashSet; HashSet java.util import java.util.Scanner; Scanner java.util import java.util.TreeMap; TreeMap java.util import java.util.Vector; Vector java.util public class Main{

	public static class pair implements Comparable<pair> {
		int id;
		int ans;
 
		pair(int x, int y) {
 
			id = x;
			ans = y;
 
		}
 
		public pair() {
 
		}
 
		public int compareTo(pair o) {
			// TODO Auto-generated method stub
 
			return this.id - o.id;
		}
	}
 
//	static int mod = (int) 998244353.;
	static ArrayList<Integer> gr[];
	static int[] ar;
	static Scanner sc = new Scanner(System.in);
	static int pri[] = new int[(int) 1e6 + 5];
	static StringBuilder out = new StringBuilder();
 
	//static long dp[];
 
	public static void main(String[] args) throws IOException {
		int t =1;// sc.nextInt();
		
		while (t-- > 0) {

			int n=sc.nextInt();
			int k=sc.nextInt();
			gr=new ArrayList[n+1];
			for(int i=0;i<=n;i++) {
				gr[i]=new ArrayList<Integer>();
			}
			
			for(int i=0;i<k;i++) {
				int di=sc.nextInt();
				for(int j=0;j<di;j++) {
					int in=sc.nextInt();
					gr[in].add(i);
				}
			}
			int cnt=0;
			for(int i=1;i<=n;i++) {
				if(gr[i].size()==0)cnt++;
			}
			System.out.println(cnt);
		}
	}
} Main //	static int mod = (int) 998244353.;
	static ArrayList<Integer> gr[]; gr static int[] ar; ar static Scanner sc = new Scanner(System.in); sc new Scanner(System.in) static int pri[] = new int[(int) 1e6 + 5]; pri new int[(int) 1e6 + 5] (int) 1e6 + 5 (int) 1e6 5 static StringBuilder out = new StringBuilder(); out new StringBuilder() public static void main(String[] args) throws IOException {
		int t =1;// sc.nextInt();
		
		while (t-- > 0) {

			int n=sc.nextInt();
			int k=sc.nextInt();
			gr=new ArrayList[n+1];
			for(int i=0;i<=n;i++) {
				gr[i]=new ArrayList<Integer>();
			}
			
			for(int i=0;i<k;i++) {
				int di=sc.nextInt();
				for(int j=0;j<di;j++) {
					int in=sc.nextInt();
					gr[in].add(i);
				}
			}
			int cnt=0;
			for(int i=1;i<=n;i++) {
				if(gr[i].size()==0)cnt++;
			}
			System.out.println(cnt);
		}
	} main {
		int t =1;// sc.nextInt();
		
		while (t-- > 0) {

			int n=sc.nextInt();
			int k=sc.nextInt();
			gr=new ArrayList[n+1];
			for(int i=0;i<=n;i++) {
				gr[i]=new ArrayList<Integer>();
			}
			
			for(int i=0;i<k;i++) {
				int di=sc.nextInt();
				for(int j=0;j<di;j++) {
					int in=sc.nextInt();
					gr[in].add(i);
				}
			}
			int cnt=0;
			for(int i=1;i<=n;i++) {
				if(gr[i].size()==0)cnt++;
			}
			System.out.println(cnt);
		}
	} int t =1; t 1 while (t-- > 0) {

			int n=sc.nextInt();
			int k=sc.nextInt();
			gr=new ArrayList[n+1];
			for(int i=0;i<=n;i++) {
				gr[i]=new ArrayList<Integer>();
			}
			
			for(int i=0;i<k;i++) {
				int di=sc.nextInt();
				for(int j=0;j<di;j++) {
					int in=sc.nextInt();
					gr[in].add(i);
				}
			}
			int cnt=0;
			for(int i=1;i<=n;i++) {
				if(gr[i].size()==0)cnt++;
			}
			System.out.println(cnt);
		} t-- > 0 t-- t 0 {

			int n=sc.nextInt();
			int k=sc.nextInt();
			gr=new ArrayList[n+1];
			for(int i=0;i<=n;i++) {
				gr[i]=new ArrayList<Integer>();
			}
			
			for(int i=0;i<k;i++) {
				int di=sc.nextInt();
				for(int j=0;j<di;j++) {
					int in=sc.nextInt();
					gr[in].add(i);
				}
			}
			int cnt=0;
			for(int i=1;i<=n;i++) {
				if(gr[i].size()==0)cnt++;
			}
			System.out.println(cnt);
		} int n=sc.nextInt(); n sc.nextInt() sc.nextInt sc int k=sc.nextInt(); k sc.nextInt() sc.nextInt sc gr=new ArrayList[n+1] gr new ArrayList[n+1] n+1 n 1 for(int i=0;i<=n;i++) {
				gr[i]=new ArrayList<Integer>();
			} int i=0; int i=0; i 0 i<=n i n i++ i++ i {
				gr[i]=new ArrayList<Integer>();
			} {
				gr[i]=new ArrayList<Integer>();
			} gr[i]=new ArrayList<Integer>() gr[i] gr i new ArrayList<Integer>() for(int i=0;i<k;i++) {
				int di=sc.nextInt();
				for(int j=0;j<di;j++) {
					int in=sc.nextInt();
					gr[in].add(i);
				}
			} int i=0; int i=0; i 0 i<k i k i++ i++ i {
				int di=sc.nextInt();
				for(int j=0;j<di;j++) {
					int in=sc.nextInt();
					gr[in].add(i);
				}
			} {
				int di=sc.nextInt();
				for(int j=0;j<di;j++) {
					int in=sc.nextInt();
					gr[in].add(i);
				}
			} int di=sc.nextInt(); di sc.nextInt() sc.nextInt sc for(int j=0;j<di;j++) {
					int in=sc.nextInt();
					gr[in].add(i);
				} int j=0; int j=0; j 0 j<di j di j++ j++ j {
					int in=sc.nextInt();
					gr[in].add(i);
				} {
					int in=sc.nextInt();
					gr[in].add(i);
				} int in=sc.nextInt(); in sc.nextInt() sc.nextInt sc gr[in].add(i) gr[in].add gr[in] gr in i int cnt=0; cnt 0 for(int i=1;i<=n;i++) {
				if(gr[i].size()==0)cnt++;
			} int i=1; int i=1; i 1 i<=n i n i++ i++ i {
				if(gr[i].size()==0)cnt++;
			} {
				if(gr[i].size()==0)cnt++;
			} if(gr[i].size()==0)cnt++; gr[i].size()==0 gr[i].size() gr[i].size gr[i] gr i 0 cnt++ cnt System.out.println(cnt) System.out.println System.out System System.out cnt String[] args args public static class pair implements Comparable<pair> {
		int id;
		int ans;
 
		pair(int x, int y) {
 
			id = x;
			ans = y;
 
		}
 
		public pair() {
 
		}
 
		public int compareTo(pair o) {
			// TODO Auto-generated method stub
 
			return this.id - o.id;
		}
	} pair int id; id int ans; ans pair(int x, int y) {
 
			id = x;
			ans = y;
 
		} pair {
 
			id = x;
			ans = y;
 
		} id = x id x ans = y ans y int x x int y y public pair() {
 
		} pair {
 
		} public int compareTo(pair o) {
			// TODO Auto-generated method stub
 
			return this.id - o.id;
		} compareTo {
			// TODO Auto-generated method stub
 
			return this.id - o.id;
		} return this.id - o.id; this.id - o.id this.id this this.id o.id o o.id pair o o Comparable public class Main{

	public static class pair implements Comparable<pair> {
		int id;
		int ans;
 
		pair(int x, int y) {
 
			id = x;
			ans = y;
 
		}
 
		public pair() {
 
		}
 
		public int compareTo(pair o) {
			// TODO Auto-generated method stub
 
			return this.id - o.id;
		}
	}
 
//	static int mod = (int) 998244353.;
	static ArrayList<Integer> gr[];
	static int[] ar;
	static Scanner sc = new Scanner(System.in);
	static int pri[] = new int[(int) 1e6 + 5];
	static StringBuilder out = new StringBuilder();
 
	//static long dp[];
 
	public static void main(String[] args) throws IOException {
		int t =1;// sc.nextInt();
		
		while (t-- > 0) {

			int n=sc.nextInt();
			int k=sc.nextInt();
			gr=new ArrayList[n+1];
			for(int i=0;i<=n;i++) {
				gr[i]=new ArrayList<Integer>();
			}
			
			for(int i=0;i<k;i++) {
				int di=sc.nextInt();
				for(int j=0;j<di;j++) {
					int in=sc.nextInt();
					gr[in].add(i);
				}
			}
			int cnt=0;
			for(int i=1;i<=n;i++) {
				if(gr[i].size()==0)cnt++;
			}
			System.out.println(cnt);
		}
	}
} public class Main{

	public static class pair implements Comparable<pair> {
		int id;
		int ans;
 
		pair(int x, int y) {
 
			id = x;
			ans = y;
 
		}
 
		public pair() {
 
		}
 
		public int compareTo(pair o) {
			// TODO Auto-generated method stub
 
			return this.id - o.id;
		}
	}
 
//	static int mod = (int) 998244353.;
	static ArrayList<Integer> gr[];
	static int[] ar;
	static Scanner sc = new Scanner(System.in);
	static int pri[] = new int[(int) 1e6 + 5];
	static StringBuilder out = new StringBuilder();
 
	//static long dp[];
 
	public static void main(String[] args) throws IOException {
		int t =1;// sc.nextInt();
		
		while (t-- > 0) {

			int n=sc.nextInt();
			int k=sc.nextInt();
			gr=new ArrayList[n+1];
			for(int i=0;i<=n;i++) {
				gr[i]=new ArrayList<Integer>();
			}
			
			for(int i=0;i<k;i++) {
				int di=sc.nextInt();
				for(int j=0;j<di;j++) {
					int in=sc.nextInt();
					gr[in].add(i);
				}
			}
			int cnt=0;
			for(int i=1;i<=n;i++) {
				if(gr[i].size()==0)cnt++;
			}
			System.out.println(cnt);
		}
	}
} Main
import java.io.IOException;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Scanner;
import java.util.TreeMap;
import java.util.Vector;



public class Main{

	public static class pair implements Comparable<pair> {
		int id;
		int ans;
 
		pair(int x, int y) {
 
			id = x;
			ans = y;
 
		}
 
		public pair() {
 
		}
 
		public int compareTo(pair o) {
			// TODO Auto-generated method stub
 
			return this.id - o.id;
		}
	}
 
//	static int mod = (int) 998244353.;
	static ArrayList<Integer> gr[];
	static int[] ar;
	static Scanner sc = new Scanner(System.in);
	static int pri[] = new int[(int) 1e6 + 5];
	static StringBuilder out = new StringBuilder();
 
	//static long dp[];
 
	public static void main(String[] args) throws IOException {
		int t =1;// sc.nextInt();
		
		while (t-- > 0) {

			int n=sc.nextInt();
			int k=sc.nextInt();
			gr=new ArrayList[n+1];
			for(int i=0;i<=n;i++) {
				gr[i]=new ArrayList<Integer>();
			}
			
			for(int i=0;i<k;i++) {
				int di=sc.nextInt();
				for(int j=0;j<di;j++) {
					int in=sc.nextInt();
					gr[in].add(i);
				}
			}
			int cnt=0;
			for(int i=1;i<=n;i++) {
				if(gr[i].size()==0)cnt++;
			}
			System.out.println(cnt);
		}
	}
}