import java.util.Scanner;

public class Main {
	public static void main(String arg[]) {
		Scanner sc = new Scanner(System.in);

		int N = sc.nextInt();
		int M = sc.nextInt();
		int C = sc.nextInt();
		int B[] = new int[M];
		int A[][] = new int[N][M];
		int cal[] = new int[N];
		int count = 0;

		for (int k = 0; k < M; k++) {
			B[k] = sc.nextInt();
		}

		for (int i = 0; i < N; i++) {
			for (int j = 0; j < M; j++) {
				A[i][j] = sc.nextInt();
			}
		}
		
		for (int i = 0; i < N; i++) {
			for (int j = 0; j < M; j++) {
				cal[i] += A[i][j] * B[j] ;
			}
			cal[i] += C;
			
			if(cal[i] > 0) {
				count++;
			}
		}

		System.out.print(count);
		
	}
} import java.util.Scanner; Scanner java.util public class Main {
	public static void main(String arg[]) {
		Scanner sc = new Scanner(System.in);

		int N = sc.nextInt();
		int M = sc.nextInt();
		int C = sc.nextInt();
		int B[] = new int[M];
		int A[][] = new int[N][M];
		int cal[] = new int[N];
		int count = 0;

		for (int k = 0; k < M; k++) {
			B[k] = sc.nextInt();
		}

		for (int i = 0; i < N; i++) {
			for (int j = 0; j < M; j++) {
				A[i][j] = sc.nextInt();
			}
		}
		
		for (int i = 0; i < N; i++) {
			for (int j = 0; j < M; j++) {
				cal[i] += A[i][j] * B[j] ;
			}
			cal[i] += C;
			
			if(cal[i] > 0) {
				count++;
			}
		}

		System.out.print(count);
		
	}
} Main public static void main(String arg[]) {
		Scanner sc = new Scanner(System.in);

		int N = sc.nextInt();
		int M = sc.nextInt();
		int C = sc.nextInt();
		int B[] = new int[M];
		int A[][] = new int[N][M];
		int cal[] = new int[N];
		int count = 0;

		for (int k = 0; k < M; k++) {
			B[k] = sc.nextInt();
		}

		for (int i = 0; i < N; i++) {
			for (int j = 0; j < M; j++) {
				A[i][j] = sc.nextInt();
			}
		}
		
		for (int i = 0; i < N; i++) {
			for (int j = 0; j < M; j++) {
				cal[i] += A[i][j] * B[j] ;
			}
			cal[i] += C;
			
			if(cal[i] > 0) {
				count++;
			}
		}

		System.out.print(count);
		
	} main {
		Scanner sc = new Scanner(System.in);

		int N = sc.nextInt();
		int M = sc.nextInt();
		int C = sc.nextInt();
		int B[] = new int[M];
		int A[][] = new int[N][M];
		int cal[] = new int[N];
		int count = 0;

		for (int k = 0; k < M; k++) {
			B[k] = sc.nextInt();
		}

		for (int i = 0; i < N; i++) {
			for (int j = 0; j < M; j++) {
				A[i][j] = sc.nextInt();
			}
		}
		
		for (int i = 0; i < N; i++) {
			for (int j = 0; j < M; j++) {
				cal[i] += A[i][j] * B[j] ;
			}
			cal[i] += C;
			
			if(cal[i] > 0) {
				count++;
			}
		}

		System.out.print(count);
		
	} Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int N = sc.nextInt(); N sc.nextInt() sc.nextInt sc int M = sc.nextInt(); M sc.nextInt() sc.nextInt sc int C = sc.nextInt(); C sc.nextInt() sc.nextInt sc int B[] = new int[M]; B new int[M] M int A[][] = new int[N][M]; A new int[N][M] N M int cal[] = new int[N]; cal new int[N] N int count = 0; count 0 for (int k = 0; k < M; k++) {
			B[k] = sc.nextInt();
		} int k = 0; int k = 0; k 0 k < M k M k++ k++ k {
			B[k] = sc.nextInt();
		} {
			B[k] = sc.nextInt();
		} B[k] = sc.nextInt() B[k] B k sc.nextInt() sc.nextInt sc for (int i = 0; i < N; i++) {
			for (int j = 0; j < M; j++) {
				A[i][j] = sc.nextInt();
			}
		} int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
			for (int j = 0; j < M; j++) {
				A[i][j] = sc.nextInt();
			}
		} {
			for (int j = 0; j < M; j++) {
				A[i][j] = sc.nextInt();
			}
		} for (int j = 0; j < M; j++) {
				A[i][j] = sc.nextInt();
			} int j = 0; int j = 0; j 0 j < M j M j++ j++ j {
				A[i][j] = sc.nextInt();
			} {
				A[i][j] = sc.nextInt();
			} A[i][j] = sc.nextInt() A[i][j] A[i] A i j sc.nextInt() sc.nextInt sc for (int i = 0; i < N; i++) {
			for (int j = 0; j < M; j++) {
				cal[i] += A[i][j] * B[j] ;
			}
			cal[i] += C;
			
			if(cal[i] > 0) {
				count++;
			}
		} int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
			for (int j = 0; j < M; j++) {
				cal[i] += A[i][j] * B[j] ;
			}
			cal[i] += C;
			
			if(cal[i] > 0) {
				count++;
			}
		} {
			for (int j = 0; j < M; j++) {
				cal[i] += A[i][j] * B[j] ;
			}
			cal[i] += C;
			
			if(cal[i] > 0) {
				count++;
			}
		} for (int j = 0; j < M; j++) {
				cal[i] += A[i][j] * B[j] ;
			} int j = 0; int j = 0; j 0 j < M j M j++ j++ j {
				cal[i] += A[i][j] * B[j] ;
			} {
				cal[i] += A[i][j] * B[j] ;
			} cal[i] += A[i][j] * B[j] cal[i] cal i A[i][j] * B[j] A[i][j] A[i] A i j B[j] B j cal[i] += C cal[i] cal i C if(cal[i] > 0) {
				count++;
			} cal[i] > 0 cal[i] cal i 0 {
				count++;
			} count++ count System.out.print(count) System.out.print System.out System System.out count String arg[] arg public class Main {
	public static void main(String arg[]) {
		Scanner sc = new Scanner(System.in);

		int N = sc.nextInt();
		int M = sc.nextInt();
		int C = sc.nextInt();
		int B[] = new int[M];
		int A[][] = new int[N][M];
		int cal[] = new int[N];
		int count = 0;

		for (int k = 0; k < M; k++) {
			B[k] = sc.nextInt();
		}

		for (int i = 0; i < N; i++) {
			for (int j = 0; j < M; j++) {
				A[i][j] = sc.nextInt();
			}
		}
		
		for (int i = 0; i < N; i++) {
			for (int j = 0; j < M; j++) {
				cal[i] += A[i][j] * B[j] ;
			}
			cal[i] += C;
			
			if(cal[i] > 0) {
				count++;
			}
		}

		System.out.print(count);
		
	}
} public class Main {
	public static void main(String arg[]) {
		Scanner sc = new Scanner(System.in);

		int N = sc.nextInt();
		int M = sc.nextInt();
		int C = sc.nextInt();
		int B[] = new int[M];
		int A[][] = new int[N][M];
		int cal[] = new int[N];
		int count = 0;

		for (int k = 0; k < M; k++) {
			B[k] = sc.nextInt();
		}

		for (int i = 0; i < N; i++) {
			for (int j = 0; j < M; j++) {
				A[i][j] = sc.nextInt();
			}
		}
		
		for (int i = 0; i < N; i++) {
			for (int j = 0; j < M; j++) {
				cal[i] += A[i][j] * B[j] ;
			}
			cal[i] += C;
			
			if(cal[i] > 0) {
				count++;
			}
		}

		System.out.print(count);
		
	}
} Main
import java.util.Scanner;

public class Main {
	public static void main(String arg[]) {
		Scanner sc = new Scanner(System.in);

		int N = sc.nextInt();
		int M = sc.nextInt();
		int C = sc.nextInt();
		int B[] = new int[M];
		int A[][] = new int[N][M];
		int cal[] = new int[N];
		int count = 0;

		for (int k = 0; k < M; k++) {
			B[k] = sc.nextInt();
		}

		for (int i = 0; i < N; i++) {
			for (int j = 0; j < M; j++) {
				A[i][j] = sc.nextInt();
			}
		}
		
		for (int i = 0; i < N; i++) {
			for (int j = 0; j < M; j++) {
				cal[i] += A[i][j] * B[j] ;
			}
			cal[i] += C;
			
			if(cal[i] > 0) {
				count++;
			}
		}

		System.out.print(count);
		
	}
}
