import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Calc calc = new Calc();
		calc.abc121B();
	}
}

class Calc {
	void abc121B() {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int m = sc.nextInt();
		int c = sc.nextInt();
		int sum = 0,count = 0;
		int[] b = new int[m];
		for(int i=0 ; i < m ; i++) {
			b[i] = sc.nextInt();
		}
		int[][] code = new int[n][m];
		for(int i=0 ; i<n ; i++) {
			for(int j=0 ; j<m ; j++) {
				code[i][j] = sc.nextInt();
			}
		}
		
		for(int i=0 ; i<n ; i++) {
			for(int j=0 ; j<m ; j++) {
				sum += b[j] * code[i][j];
			}
			if(sum+c >0) {
				count ++;
			}
          sum = 0;
		}
		System.out.println(count);
	}
} import java.util.HashMap; HashMap java.util import java.util.HashSet; HashSet java.util import java.util.Map; Map java.util import java.util.Scanner; Scanner java.util public class Main {

	public static void main(String[] args) {
		Calc calc = new Calc();
		calc.abc121B();
	}
} Main public static void main(String[] args) {
		Calc calc = new Calc();
		calc.abc121B();
	} main {
		Calc calc = new Calc();
		calc.abc121B();
	} Calc calc = new Calc(); calc new Calc() calc.abc121B() calc.abc121B calc String[] args args class Calc {
	void abc121B() {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int m = sc.nextInt();
		int c = sc.nextInt();
		int sum = 0,count = 0;
		int[] b = new int[m];
		for(int i=0 ; i < m ; i++) {
			b[i] = sc.nextInt();
		}
		int[][] code = new int[n][m];
		for(int i=0 ; i<n ; i++) {
			for(int j=0 ; j<m ; j++) {
				code[i][j] = sc.nextInt();
			}
		}
		
		for(int i=0 ; i<n ; i++) {
			for(int j=0 ; j<m ; j++) {
				sum += b[j] * code[i][j];
			}
			if(sum+c >0) {
				count ++;
			}
          sum = 0;
		}
		System.out.println(count);
	}
} Calc void abc121B() {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int m = sc.nextInt();
		int c = sc.nextInt();
		int sum = 0,count = 0;
		int[] b = new int[m];
		for(int i=0 ; i < m ; i++) {
			b[i] = sc.nextInt();
		}
		int[][] code = new int[n][m];
		for(int i=0 ; i<n ; i++) {
			for(int j=0 ; j<m ; j++) {
				code[i][j] = sc.nextInt();
			}
		}
		
		for(int i=0 ; i<n ; i++) {
			for(int j=0 ; j<m ; j++) {
				sum += b[j] * code[i][j];
			}
			if(sum+c >0) {
				count ++;
			}
          sum = 0;
		}
		System.out.println(count);
	} abc121B {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int m = sc.nextInt();
		int c = sc.nextInt();
		int sum = 0,count = 0;
		int[] b = new int[m];
		for(int i=0 ; i < m ; i++) {
			b[i] = sc.nextInt();
		}
		int[][] code = new int[n][m];
		for(int i=0 ; i<n ; i++) {
			for(int j=0 ; j<m ; j++) {
				code[i][j] = sc.nextInt();
			}
		}
		
		for(int i=0 ; i<n ; i++) {
			for(int j=0 ; j<m ; j++) {
				sum += b[j] * code[i][j];
			}
			if(sum+c >0) {
				count ++;
			}
          sum = 0;
		}
		System.out.println(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 sum = 0 sum 0 count = 0; count 0 int[] b = new int[m]; b new int[m] m for(int i=0 ; i < m ; i++) {
			b[i] = sc.nextInt();
		} int i=0 ; int i=0 ; i 0 i < m i m i++ i++ i {
			b[i] = sc.nextInt();
		} {
			b[i] = sc.nextInt();
		} b[i] = sc.nextInt() b[i] b i sc.nextInt() sc.nextInt sc int[][] code = new int[n][m]; code new int[n][m] n m for(int i=0 ; i<n ; i++) {
			for(int j=0 ; j<m ; j++) {
				code[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++) {
				code[i][j] = sc.nextInt();
			}
		} {
			for(int j=0 ; j<m ; j++) {
				code[i][j] = sc.nextInt();
			}
		} for(int j=0 ; j<m ; j++) {
				code[i][j] = sc.nextInt();
			} int j=0 ; int j=0 ; j 0 j<m j m j++ j++ j {
				code[i][j] = sc.nextInt();
			} {
				code[i][j] = sc.nextInt();
			} code[i][j] = sc.nextInt() code[i][j] code[i] code i j sc.nextInt() sc.nextInt sc for(int i=0 ; i<n ; i++) {
			for(int j=0 ; j<m ; j++) {
				sum += b[j] * code[i][j];
			}
			if(sum+c >0) {
				count ++;
			}
          sum = 0;
		} int i=0 ; int i=0 ; i 0 i<n i n i++ i++ i {
			for(int j=0 ; j<m ; j++) {
				sum += b[j] * code[i][j];
			}
			if(sum+c >0) {
				count ++;
			}
          sum = 0;
		} {
			for(int j=0 ; j<m ; j++) {
				sum += b[j] * code[i][j];
			}
			if(sum+c >0) {
				count ++;
			}
          sum = 0;
		} for(int j=0 ; j<m ; j++) {
				sum += b[j] * code[i][j];
			} int j=0 ; int j=0 ; j 0 j<m j m j++ j++ j {
				sum += b[j] * code[i][j];
			} {
				sum += b[j] * code[i][j];
			} sum += b[j] * code[i][j] sum b[j] * code[i][j] b[j] b j code[i][j] code[i] code i j if(sum+c >0) {
				count ++;
			} sum+c >0 sum+c sum c 0 {
				count ++;
			} count ++ count sum = 0 sum 0 System.out.println(count) System.out.println System.out System System.out count public class Main {

	public static void main(String[] args) {
		Calc calc = new Calc();
		calc.abc121B();
	}
} public class Main {

	public static void main(String[] args) {
		Calc calc = new Calc();
		calc.abc121B();
	}
} Main
import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Calc calc = new Calc();
		calc.abc121B();
	}
}

class Calc {
	void abc121B() {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int m = sc.nextInt();
		int c = sc.nextInt();
		int sum = 0,count = 0;
		int[] b = new int[m];
		for(int i=0 ; i < m ; i++) {
			b[i] = sc.nextInt();
		}
		int[][] code = new int[n][m];
		for(int i=0 ; i<n ; i++) {
			for(int j=0 ; j<m ; j++) {
				code[i][j] = sc.nextInt();
			}
		}
		
		for(int i=0 ; i<n ; i++) {
			for(int j=0 ; j<m ; j++) {
				sum += b[j] * code[i][j];
			}
			if(sum+c >0) {
				count ++;
			}
          sum = 0;
		}
		System.out.println(count);
	}
}