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 c = sc.nextInt();
		int[] b_m = new int[m];
		int[][] a_nm = new int[n][m];
		for (int i = 0; i < m; i++) {
			b_m[i] = sc.nextInt();
		}
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++) {
				a_nm[i][j] = sc.nextInt();
			}
		}
		sc.close();
		int count = 0;
		for (int i = 0; i < n; i++) {
			int ans = c;
			for (int j = 0; j < m; j++) {
				ans += a_nm[i][j] * b_m[j];
			}
			if (ans > 0) {
				count++;
			}
		}
		System.out.println(count);
	}

}

/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz