Problem:
 Score : 200 points    Problem Statement There are N pieces of source code. The characteristics of the i -th code is represented by M integers A_{i1}, A_{i2}, ..., A_{iM} .  Additionally, you are given integers B_1, B_2, ..., B_M and C .  The i -th code correctly solves this problem if and only if A_{i1} B_1 + A_{i2} B_2 + ... + A_{iM} B_M + C > 0 .  Among the N codes, find the number of codes that correctly solve this problem.      Constraints  All values in input are integers.  1 \leq N, M \leq 20  -100 \leq A_{ij} \leq 100  -100 \leq B_i \leq 100  -100 \leq C \leq 100         Input Input is given from Standard Input in the following format:  N  M  C  B_1  B_2  ...  B_M  A_{11}  A_{12}  ...  A_{1M}  A_{21}  A_{22}  ...  A_{2M}  \vdots  A_{N1}  A_{N2}  ...  A_{NM}       Output Print the number of codes among the given N codes that correctly solve this problem.        Sample Input 1 2 3 -10
1 2 3
3 2 1
1 2 2      Sample Output 1 1  Only the second code correctly solves this problem, as follows:   Since 3 \times 1 + 2 \times 2 + 1 \times 3 + (-10) = 0 \leq 0 , the first code does not solve this problem.  1 \times 1 + 2 \times 2 + 2 \times 3 + (-10) = 1 > 0 , the second code solves this problem.        Sample Input 2 5 2 -4
-2 5
100 41
100 40
-3 0
-6 -2
18 -13      Sample Output 2 2       Sample Input 3 3 3 0
100 -100 0
0 100 100
100 100 100
-100 100 100      Sample Output 3 0  All of them are Wrong Answer . Except yours.

Solution (Python):
N, M, C = map(int, input().split())
B = list(map(int, input().split()))

A = []
for _ in range(N):
    A.append(list(map(int, input().split())))

ans = 0
for i in range(N):
    sum = C
    for j in range(M):
        sum += A[i][j] * B[j]

    if sum > 0:
        ans += 1
print(ans)

Solution (Python):
n,m,c = map(int,input().split())
b = list(map(int,input().split()))
a = [list(map(int,input().split())) for i in range(n)]
ans = 0
for j in range(n):
    check = c
    for i in range(m):
        check += b[i] * a[j][i]
    if check > 0:ans += 1
print(ans)

Solution (Python):
N, M, C = map(int, input().split())
B = list(map(int, input().split()))
As = [ list(map(int, input().split())) for _ in range(N) ]

cnt = 0
for A in As:
    s = 0
    for a,b in zip(A,B):
        s += a*b
    if s+C>0:
        cnt += 1

print(cnt)

Solution (Python):
import numpy as np
N, M, C = map(int, input().split())
B = np.array(list(map(int, input().split())))
cnt = 0
for _ in range(N):
    A =np.array( list(map(int, input().split())))
    if sum(A * B) + C > 0:
        cnt += 1
print(cnt)

Solution (Python):
n, m, c = map(int, input().split())
b = list(map(int, input().split()))
a = [list(map(int, input().split())) for _ in range(n)]
cnt = 0

for i in range(n):
    sum = c
    for j in range(m):
        sum += a[i][j] * b[j]
    if sum > 0:
        cnt += 1

print(cnt)

Solution (Python):
import numpy
n, m, c = map(int, input().split())
b = list(map(int, input().split()))
a = [list(map(int, input().split())) for i in range(n)]

count = 0
for i in range(n):
    if numpy.dot(a[i], b) + c > 0:
        count += 1

print(count)

Solution (Python):
N, M, C = map(int, input().split())
B = [int(i) for i in input().split()]
ans = 0
for i in range(N):
    A = [int(i) for i in input().split()]
    sum = 0
    for j in range(M):
        sum += A[j]*B[j]
    sum += C
    if sum > 0:
        ans += 1
print(ans)

Solution (Python):
N,M,C = [int(i) for i in input().split()]
B = [int(i) for i in input().split()]

ans = 0
for _ in range(N):
    A = [int(j) for j in input().split()]
    p = C
    for i in range(M):
        p += A[i]*B[i]
    if p > 0:
        ans += 1
print(ans)

Solution (Python):
n,m,c=map(int,input().split())
b=[int(i) for i in input().split()]
a=[[int(i) for i in input().split()]for j in range(n)]
ans=0
for i in range(n):
    k=0
    for j in range(m):
        k += b[j]*a[i][j]
    if k>-c:
        ans += 1
print(ans)

Solution (Python):


import numpy


def main():
  n, _, c = map(int, input().split())
  b = numpy.array(list(map(int, input().split())), dtype=numpy.int32)
  a = [numpy.array(list(map(int, input().split())), dtype=numpy.int32) for _ in range(n)]
  z = 0

  for x in a:
    if numpy.sum(x * b) + c > 0:
      z += 1

  print(z, flush=True)


if __name__ == '__main__':
  main()

Solution (Python):
n,m,c = map(int,input().split())
b = list(map(int,input().split()))
a = [list(map(int,input().split())) for i in range(n)]

ans = 0
for i in range(n):
        tmp = 0
        for j in range(m):
                tmp += a[i][j]*b[j]
        if tmp+c >0:
                ans += 1
print(ans)

Solution (Python):
N, M, C = map(int, input().split())
B = list(map(int, input().split()))
ans = 0
for i in range(N):
    A = list(map(int, input().split()))
    if sum(A[j]*B[j] for j in range(M)) + C > 0:
        ans += 1
print(ans)

Solution (Python):
import numpy as np

[N, M, C] = list(map(int, input().split(' ')))
B_list = list(map(int, input().split(' ')))
A_mat = [list(map(int, input().split(' '))) for _ in range(N)]

corrected = 0
for i in range(N):
    value = np.dot(B_list, A_mat[i]) + C
    if value > 0:
        corrected = corrected + 1

print(corrected)

Solution (Python):
N, M, C = map(int, input().split())
B = list(map(int, input().split()))
A = [list(map(int, input().split())) for i in range(N)]

ans = 0
for i in range(N):
    res = C
    for j in range(M):
        res += A[i][j] * B[j]
    if res > 0:
        ans += 1
print(ans)

Solution (Python):
N, M, C = map(int, input().split())
B = list(map(int, input().split()))
AA = []
for _ in range(N):
    AA.append(list(map(int, input().split())))

def func(A, B, C):
    ret = 0
    for a, b in zip(A, B):
        ret += a*b
    if ret + C > 0:
        return True
    else:
        return False

tot = 0
for A in AA:
    tot += func(A, B, C)
print(tot)

Solution (Python):
import numpy as np

N,M,C = map(int,input().split())
B = np.array(list(map(int,input().split())))

cnt=0
for i in range(N):
    A = np.array(list(map(int,input().split())))
    
    cnt += int(np.dot(A, B)+C > 0)


print(cnt)

Solution (Python):
N,M,C = list(map(int, input().split()))
B = list(map(int,(input().split())))

A = []
count=0
for i in range(N):
    
    inp = list(map(int,(input().split())))
    su=0
    for j in range(M):
        su+=inp[j]*B[j]
    
    if su+C>0:
        count+=1
print(count)

Solution (Python):
N,M,C = (int(x) for x in input().split())
B = [int(x) for x in input().split()]
ans = 0

for i in range(N):
    A = [int(x) for x in input().split()]
    check = C
    for j in range(M):
        check += A[j]*B[j]
    if check > 0:
        ans += 1

print(ans)

Solution (Python):
N, M, C = map(int, input().split())
B = list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(N)]
ans = len([a for a in A if sum(x * y for x, y in zip(a, B)) + C > 0])
print(ans)

Solution (Python):
n, m, c = map(int, input().split())
b = list(map(int, input().split()))
count = 0
for i in range(n):
    a = list(map(int, input().split()))
    ans = c
    for j in range(m):
        ans += b[j] * a[j]
    if ans > 0:
        count += 1
print(count)

Solution (Python):
import numpy as np
N,M,C = map(int, input().split())
B = np.array(list(map(int, input().split())))
count = 0
for _ in range(N):
    A = np.array(list(map(int, input().split())))
    if np.dot(A,B) + C > 0:
        count += 1
print(count)

Solution (Python):

import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline


N, M, C = map(int, input().split())
B = list(map(int, input().split()))

cnt = 0
for _ in range(N):
    A = list(map(int, input().split()))
    s = sum([a*b for a, b in zip(A, B)])
    if s+C > 0:
        cnt += 1
print(cnt)

Solution (Python):

import math
import copy
 
 
 
 
def nCast(number):
    if type(number)==str:
        return int(number)
    for idx in range(0,len(number)):
        if type(number[idx])==str:
 
            number[idx]=int(number[idx])
        else:
            nCast(number[idx])
    return number
    
def inputArr(w):
    l=list()
    for idx in range(0,w):
        l.append(input())
    return l
def inputArr1(w):
    l=list()
    for idx in range(0,w):
        l.append(input().split())
    return l
 
a=nCast(input().split());
b=nCast(input().split());
c=nCast(inputArr1(a[0]));

 
def func():
    result=0
    for number in c:
        sumall=0
        for idx in range(0,len(number)):
            sumall+=number[idx]*b[idx]
        if sumall+a[2]>0:
            result+=1
    return result
print(func())

Solution (Python):
N, M, C = list(map(int, input().split()))
B = list(map(int, input().split()))
A = []
for i in range(N):
    A.append(list(map(int, input().split())))




def main():
    cnt = 0
    for i in range(N):
        val = C
        for j in range(M):
            val += A[i][j] * B[j]
        
        if val > 0:
            cnt += 1
    return cnt

print(main())

Solution (Python):
N,M,C=map(int,input().split())
B=list(map(int,input().split()))
ans=0
for i in range(N):
  A=list(map(int,input().split()))
  ans += 1 if sum([A[k]*B[k] for k in range(M)])+C > 0 else 0
print(ans)

Solution (Python):
def main():
    N, M, C = map(int, input().split())
    B = list(map(int, input().split()))

    ans = 0
    for _ in range(N):
        A = list(map(int, input().split())) 
        s = C
        for i in range(M):
            s += A[i] * B[i]
        if s > 0:
            ans += 1
    print(ans)

main()

Solution (Python):
N,M,C = map(int, input().split())
blist = [int(x) for x in input().split()]
alist = []
for i in range(N):
    a = [int(x) for x in input().split()]
    alist.append(a)

score = 0
for a in alist:
    cache = 0
    for i,b in enumerate(blist):
        cache += a[i]*b
    if cache+C > 0:
        score += 1

print(score)

Solution (Python):
n,m,c = map(int,input().split())
b = list(map(int,input().split()))
res = 0
for i in range(n):
    a = list(map(int,input().split()))
    calc = 0
    for j in range(m):
        calc += a[j]*b[j]
    else:
        calc += c
    if calc > 0:
        res += 1
else:
    print(res)

Solution (Python):
n, m , c = map(int, input().split())
b = [int(i) for i in input().split()]
a = [[int(x) for x in input().split()] for _ in range(n)]
ans = 0
for i in a:
    su = 0
    for j in range(len(i)):
        su += i[j] * b[j]
    su += c
    if su > 0:
        ans += 1
print(ans)

Solution (Python):
n,m,c=map(int,input().split())
count=0
b=list(map(int,input().split()))
for i in range(n):
    a=list(map(int,input().split()))
    d=c
    for j in range(m):
        d+=a[j]*b[j]
    if d>0:
        count+=1
print(count)

Solution (Python):

N,M,C=map(int,input().split())
B=list(map(int,input().split()))
count=0
for i in range(N):
        A=list(map(int,input().split()))
        sum1=0
        for j in range(M):
              sum1+=A[j]*B[j]
        if sum1+C>0:
              count+=1
print(count)

Solution (Python):
N,M,C = map(int,input().split())
Bn = list(map(int,input().split()))
ans = 0
for i in range(N):
    An = list(map(int,input().split()))
    score = 0
    for b,a in zip(Bn,An):
        score += b*a
    score+=C
    if score>0:
        ans +=1
print(ans)

Solution (Python):
import sys
input = sys.stdin.readline

def main():
	N, M, C = map(int, input().split())
	B = list(map(int, input().split()))
	count = 0
	for _ in range(N):
		X = list(map(int, input().split()))
		AL = 0
		for i in range(M):
			AL += X[i] * B[i]
		AL += C
		if AL > 0:
			count += 1
	print(count)

if __name__ == '__main__':
	main()

Solution (Python):
n, m, c = [int(i) for i in input().split()]
b = [int(i) for i in input().split()]
ans = 0
for i in range(n):
    a = [int(i) for i in input().split()]
    tmp = c + sum([a[j]*b[j] for j in range(m)])
    if tmp > 0:
        ans += 1
print(ans)

Solution (Python):
n,m,c = map(int, input().split())
B = [int(b) for b in input().split()]
ans = 0
for _ in range(n):
    A = [int(a) for a in input().split()]
    D = [i*j for i,j in zip(A,B)]
    if sum(D)+c > 0:
        ans += 1
        
print(ans)

Solution (Python):
(n, m, c) = map(int, input().split())
b = list(map(int, input().split()))
a = []
for _ in range(n):
    a.append(list(map(int, input().split())))

num = 0
for code in a:
    sum = c
    for i in range(m):
        sum += code[i] * b[i]
    if sum > 0:
        num += 1
print(num)

Solution (Python):
N, M, C=map(int, input().split())
B=list(map(int,input().split()))
A=[list(map(int,input().split())) for _ in range(N)]
ans=0
for i in range(N):
	tmp=0
	for j in range(M):
		tmp+=A[i][j]*B[j]
	tmp+=C
	if tmp>0:
		ans+=1
print(ans)

Solution (Python):
N,M,C = map(int,input().split())
B = list(map(int,input().split()))
count = 0
for i in range(N):
  ABsum = 0
  A = list(map(int,input().split()))
  for j in range(M):
    ABsum += A[j] * B[j]
  if (ABsum + C) > 0:
    count +=1
print(count)

Solution (Python):
I=lambda:map(int,input().split());n,m,c=I();*b,=I();print(sum(sum(x*y for x,y in zip(I(),b))+c>0for _ in[0]*n))

Solution (Python):

"""
Created on Sat Mar  9 20:50:25 2019

@author: Yamazaki Kenichi
"""

N,M,C = map(int,input().split())
B = list(map(int,input().split()))
A = [list(map(int,input().split())) for i in range(N)]

ans = 0
for i in range(N):
    res = 0
    for j in range(M):
        res += A[i][j]*B[j]
    res += C
    if res > 0:
        ans += 1
print(ans)

Solution (Python):
list1=input().split(' ')
n=int(list1[0])
m=int(list1[1])
c=int(list1[2])
list2=input().split(' ')
correct=0
for i in range(n):
    list=input().split(' ')
    amount=0
    for j in range(m):
        amount+=int(list2[j])*int(list[j])
    amount+=c
    if amount>0:
        correct+=1
print(correct)

Solution (Python):
N,M,C=map(int,input().split())
B=list(map(int,input().split()))
count=0
for i in range(N):
    A=list(map(int,input().split()))
    val=0
    for i,j in zip(A,B):
        val+=i*j
    if val+C>0:
        count+=1

print(count)

Solution (Python):
a = list(map(int,input().split()))
N = a[0]
M = a[1]
C = a[2]
A = [[] for i in range(N)]
B = list(map(int,input().split()))
ans = 0
for i in range(N):
    temp = list(map(int,input().split()))
    for j in range(M):
        A[i].append(temp[j])

for i in range(N):
    cnt = 0
    for j in range(M):
        cnt += A[i][j]*B[j]
    if cnt + C > 0:
        ans += 1
print(str(ans))

Solution (Python):
import numpy as np
n, m, c = map(int, input().split(' '))
b = np.array(list(map(int, input().split(' '))))
a = []
for i in range(n):
    a.append(np.array(list(map(int, input().split(' ')))))

count = 0
for nn in range(len(a)):
    if np.sum(a[nn] * b) + c > 0:
        count += 1
print(count)

Solution (Python):
N, M, C = map(int, input().split())
b_list = list(map(int, input().split()))

items = []
for i in range(N):
    items.append(list(map(int, input().split())))

ans = 0

for item in items:
    tmp = 0
    for i in range(M):
        a = item[i]
        b = b_list[i]
        tmp += a * b
    if tmp + C > 0:
        ans +=1
print(ans)

Solution (Python):
n,m,c = list(map(int, input().split()))
b = list(map(int, input().split()))
a = []
for k in range(n):
    a.append(list(map(int, input().split())))

num = 0
for k in range(n):
    temp = 0
    for i in range(m):
        temp += a[k][i] * b[i]

    if temp > -c:
        num += 1
print(num)

Solution (Python):

n, m, c = map(int, input().split())
b = list(map(int, input().split()))
ans = 0
for i in range(n):
    a = list(map(int, input().split()))
    s = 0
    for j in range(m):
        s += a[j]*b[j]
    s += c
    if s > 0:
        ans += 1
print(ans)

Solution (Python):
N,M,C = map(int,input().split())
B = list(map(int,input().split()))

ans = 0

for _ in range(N):
  A = list(map(int,input().split()))
  score = 0

  for i in range(M):
    score += A[i] * B[i]
  score += C

  if score > 0:
    ans += 1

print(ans)

Solution (Python):
import sys

def main():
    input = sys.stdin.readline
    N, M, C = map(int, input().split())
    B = list(map(int, input().split()))

    ans = 0
    for _ in range(N):
        A = list(map(int, input().split()))
        check = 0
        for i in range(M):
            check += A[i] * B[i]
        if check + C > 0:
            ans += 1

    print(ans)


if __name__ == '__main__':
    main()

Solution (Python):
N, M, C = map(int, input().split())
B = [int(i) for i in input().split()]
ans = 0
for _ in range(N):
    a = [int(i) for i in input().split()]
    s = 0
    for m in range(M):
        s += a[m] * B[m]
    s += C
    if s > 0:
        ans += 1
print(ans)

Solution (Python):
n,m,c = list(map(int,input().split()))
b = list(map(int,input().split()))

ans = 0
for i in range(n):
	a = list(map(int,input().split()))
	val = c
	for j in range(m):
		val += a[j]*b[j]
	if val > 0:
		ans += 1

print(ans)

Solution (Python):
N, M, C = map(int, input().split())
B = list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(N)]

ans = 0
for an in A:
  tmp = 0
  for a, b in zip(an, B):
    tmp += a*b
  tmp += C
  if tmp > 0:
    ans += 1

print(ans)

Solution (Python):
N, M, C = map(int, input().split())
B = list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(N)]

counter = 0

for i in range(N):
    num = 0
    for j in range(M):
        num += B[j] * A[i][j]

    num += C
    if num > 0:
        counter += 1

print(counter)

Solution (Python):

import numpy as np
N, M, C = map(int, input().split())

B = np.array(list(map(int, input().split())))
A = np.array([[0] * M for i in range(N)])

for i in range(N):
    A[i] = list(map(int, input().split()))



cnt = 0
for i in range(N):
    tmp = 0
    for j in range(M):
        tmp += A[i][j] * B[j]
    if tmp+C > 0:
        cnt += 1
print(cnt)

Solution (Python):
N, M, C = map(int, input().split())
B = list(map(int, input().split()))
count = 0
for i in range(N):
    a = list(map(int, input().split()))
    sum = 0
    for j in range(len(a)):
        sum += a[j] * B[j]
    sum += C
    if sum > 0:
        count +=1
print(count)

Solution (Python):
n,m,c=map(int,input().split())
b=list(map(int,input().split()))
ans=0
for i in range(n):
    d=0
    a=list(map(int,input().split()))
    for j in range(m):
        d+=a[j]*b[j]
    if d+c>0:ans+=1
print(ans)

Solution (Python):
N,M,C = map(int,input().split())
B = list(map(int,input().split()))
ans = 0
for n in range(N):
    A = list(map(int,input().split()))
    x = 0
    for m in range(M):
        x += A[m] * B[m]
    x += C
    if x > 0:
        ans += 1

print(ans)

Solution (Python):
import numpy as np
N,M,C =list(map(int, input().split()))
B = np.array(list(map(int, input().split())))
ans = 0
for i in range(N):
    A = np.array(list(map(int, input().split())))
    ans += int((np.dot(A,B) + C) > 0)
print(ans)

Solution (Python):
N, M, C = map(int, input().split())
B = list(map(int, input().split()))
K = 0
for i in range(N):
    A = list(map(int, input().split()))
    x = 0
    for j in range(M):
        x += B[j]*A[j]
    if x > -1*C:
        K += 1

print(K)

Solution (Python):
N,M,C = map(int,input().split())
B = [int(i) for i in input().split()]
A = [[int(i) for i in input().split()] for _ in range(N)]

ans = 0
for i in range(N):
    culc = C
    for j in range(M):
        culc += A[i][j] * B[j]
    if culc>0:
        ans += 1
print(ans)

Solution (Python):
n,m,c=map(int,input().split())
hogeA=list(map(int,input().split()))
ans=0

for i in range(n):
  hogeB=list(map(int,input().split()))
  kei=0
  for j in range(m):
    kei+=hogeA[j]*hogeB[j]
  if(kei+c>0):
    ans+=1

print(ans)

Solution (Python):
N, M, C = map(int, input().split())
Bi = list(map(int, input().split()))
count = 0
for i in range(N):
    Ai = list(map(int, input().split()))
    t = C
    for i in range(M):
        t += Ai[i] * Bi[i]
    if t > 0:
        count += 1
print(count)

Solution (Python):
n,m,c = map(int,input().split())
b = list(map(int,input().split()))
ans = 0

for i in range(n) :
    a = list(map(int,input().split()))
    d = 0
    for j in range(m) :
        d += a[j]*b[j]
    d += c
    if d > 0 :
        ans += 1

print(ans)

Solution (Python):
N, M, C = map(int, input().split())
B = list(map(int, input().split()))
A = [list(map(int, input().split())) for i in range(N)]
ok = 0
for i in range(N):
    if sum([A[i][j]*B[j] for j in range(M)]) + C > 0:
        ok += 1
print(ok)

Solution (Python):
N, M, C = map(int, input().split())
B = [int(i) for i in input().split()]
ans = 0

for i in range(N):
    A = [int(i) for i in input().split()]
    if sum([a * b for a, b in zip(A, B)]) + C > 0:
        ans += 1

print(ans)

Solution (Python):
lst=input().split(" ")
N=int(lst[0])
M=int(lst[1])
C=int(lst[2])
count=0
lst=input().split(" ")
B = [int(b) for b in lst]
for i in range(N):
    sum=0
    lst=input().split(" ")
    A=[int(a) for a in lst]
    for j in range(M):
        sum += A[j]*B[j]
    if sum+C>0:
        count += 1
    
print(count)

Solution (Python):
n,m,c = map(int,input().split())
b = list(map(int,input().split()))
count = 0
for i in range(n):
    a = list(map(int,input().split()))
    num = c
    for j in range(m):
        num += a[j]*b[j]
    if num > 0:
        count += 1 
print(count)

Solution (Python):
import sys
def myin():
    for s in sys.stdin:
        for t in s.split():
            yield t

_in=myin()
N,M,C=[int(next(_in)) for i in range(3)]
B=[int(next(_in)) for i in range(M)]
A=[[int(next(_in)) for i in range(M)] for j in range(N)]
ans=0
for i in range(N):
    s=C
    for j in range(M):
        s+=A[i][j]*B[j]
    if s > 0:
        ans+=1
print(ans)

Solution (Python):
import numpy as np
N, M, C = map(int, input().split(' '))
B = np.array(list(map(int, input().split(' '))))
ans = 0
for i in range(N):
    A = np.array(list(map(int, input().split(' '))))
    if(sum(A*B)+C > 0):
        ans += 1
print(ans)

Solution (Python):
N, M, C = map(int, input().split())
B = list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(N)]

res = 0
for i in range(N):
    tmp = 0
    for j in range(M):
        tmp += B[j] * A[i][j]
        
    if tmp + C > 0:
        res += 1
        
print(res)

Solution (Python):
N, M, C = [ int(x) for x in input().split() ]
Bs = [ int(x) for x in input().split()  ]
As = [ [ int(x) for x in input().split() ] for _ in range(N) ]

ans = 0
for A in As:
    x = C
    for a, b in zip(A, Bs):
        x += a * b
    if x > 0:
        ans += 1

print(ans)

Solution (Python):
def readln():
    return list(map(int, input().split()))


N, M, C = readln()
B = readln()

A = [readln() for _ in range(N)]

ans = 0
for a in A:
    tmp = sum([aa * b for aa, b in zip(a, B)]) + C
    if tmp > 0:
        ans += 1

print(ans)

Solution (Python):
N,M,C = map(int,input().split())
B = list(map(int,input().split()))
A = [0]*N
for i in range(N):
    A[i] = list(map(int,input().split()))

ans = 0
for i in range(N):
    s = C
    for j in range(M):
        s += A[i][j]*B[j]
    if s>0:
        ans += 1
print(ans)

Solution (Python):
N, M, C = map(int, input().split())
B = list(map(int, input().split()))
cnt = 0
for i in range(N):
    A = list(map(int, input().split()))
    ABsum = 0
    for j in range(M):
        ABsum += A[j]*B[j]
    ABsum += C
    if ABsum > 0:
        cnt += 1

print(cnt)

Solution (Python):
NMC = list(map(int,input().strip().split()))
Bs = list(map(int,input().strip().split()))

N = NMC[0]
M = NMC[1]
C = NMC[2]

count = 0
for i in range(0,N):
    As =list(map(int,input().strip().split()))
    summa = 0
    for h in range(0,M):
        summa += As[h] * Bs[h]
    summa += C
    if summa > 0:
        count += 1

print(count)

Solution (Python):
N,M,C=map(int,input().split())
Bl=list(map(int,input().split()))
ans=0
for _ in range(N):
    Al=list(map(int,input().split()))
    if sum(a*b for a,b in zip(Al, Bl))+C>0:
        ans+=1
print(ans)

Solution (Python):
n, m, c = [int(i) for i in input().split() ]
b = [int(i) for i in input().split() ]
ok = 0
for i in range(n):
    a = [int(i) for i in input().split() ]
    ans = c
    for j in range(m):
        ans += a[j]*b[j]
    if ans > 0:
        ok += 1
print(ok)

Solution (Python):
n, m , c = list(map(int, input().split()))
b = list(map(int, input().split()))

ans = 0
for i in range(n):
    a = list(map(int, input().split()))
    sum = 0
    for j in range(m):
        sum += a[j] * b[j]

    if sum + c > 0:
        ans += 1

print(ans)

Solution (Python):
N,M,C = map(int, input().split())
B = list(map(int, input().split()))
ans = 0
for _ in range(N):
    A = list(map(int, input().split()))
    value = C
    for i in range(M):
        value += A[i]*B[i]
    if value>0:
        ans += 1
print(ans)

Solution (Python):

N, M, C = map(int, input().split())
B = list(map(int, input().split()))
A = [list(map(int,input().split())) for i in range(N)]
ans = 0
for a in A:
    d = [a[k] * B[k] for k in range(M)]
    if sum(d) + C > 0:
        ans +=1
print(ans)

Solution (Python):
n, m, c = map(int, input().split())
b_array = [int(x) for x in input().split()]
a_array = [[int(x) for x in input().split()] for x in range(n)]
cnt = 0
for i in range(n):
    tmp = 0
    for x, y in zip(b_array, a_array[i]):
        tmp += x*y
    if tmp+c > 0:
        cnt += 1
else:
    print(cnt)

Solution (Python):
n, m, c = map(int, input().split(' '))
coff = list(map(int, input().split(' ')))
ans = 0
for _ in range(n):
    a = list(map(int, input().split(' ')))
    tmp = 0
    for i, j in zip(a, coff):
        tmp += (i * j)

    tmp += c

    if tmp > 0:
        ans += 1
print(ans)

Solution (Python):
n,m,c=map(int,input().split())
b=list(map(int,input().split()))
ans=0
for i in range(n):
    a=list(map(int,input().split()))
    sum=0
    for i in range(m):
        sum+=b[i]*a[i]
    sum+=c
    if sum>0:
        ans+=1
print(ans)

Solution (Python):
N, M, C = map(int, input().split())
B = list(map(int, input().split()))
A = [list(map(int, input().split())) for i in range(N)]
cnt = 0
for i in range(N):
  sum = C
  for j in range(M):
    sum += A[i][j]*B[j]
  if sum > 0:
    cnt += 1
print(cnt)

Solution (Python):


import sys, re
from collections import deque, defaultdict, Counter
from math import sqrt, hypot, factorial, pi, sin, cos, radians, log10
if sys.version_info.minor >= 5: from math import gcd
else: from fractions import gcd 
from heapq import heappop, heappush, heapify, heappushpop
from bisect import bisect_left, bisect_right
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul, xor
from copy import copy, deepcopy
from functools import reduce, partial
from fractions import Fraction
from string import ascii_lowercase, ascii_uppercase, digits
from datetime import date

def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def round(x): return int((x*2+1) // 2)
def fermat(x, y, MOD): return x * pow(y, MOD-2, MOD) % MOD
def lcm(x, y): return (x * y) // gcd(x, y)
def lcm_list(nums): return reduce(lcm, nums, 1)
def gcd_list(nums): return reduce(gcd, nums, nums[0])
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7

N,M,C=MAP()
B=LIST()

ans=0
for _ in range(N):
    A=LIST()
    sm=0
    for i in range(M):
        sm+=A[i]*B[i]
    sm+=C
    if sm>0:
        ans+=1
print(ans)

Solution (Python):
a, b, c = map(int, input().split())
X = list(map(int, input().split()))
ans = 0
num = 0
for i in range(a):
    A = list(map(int, input().split()))
    for i in range(b):
        num += A[i] * X[i]
    if(num + c > 0):
        ans += 1
    num = 0
print(ans)

Solution (Python):
N,M,C = map(int,input().split())
B = list(map(int,input().split()))
count = 0
for i in range(N):
  ans = 0
  A = list(map(int,input().split()))
  for j in range(M):
    ans += A[j]*B[j]
  ans += C
  if ans>0:
    count+=1
print(count)

Solution (Python):
N, M, C = map(int, input().split())
B = [int(i) for i in input().split()]
inputs = [[int(i) for i in input().split()] for _ in range(N)]

ans = 0
for i in range(N):
    total = 0
    for a, b in zip(inputs[i], B):
        total += a * b
    if total + C > 0:
        ans += 1

print(ans)

Solution (Python):



N, M, C = map(int, input().split(" "))
B = list(map(int, input().split(" ")))

ret = 0
for i in range(N):
    A = list(map(int, input().split(" ")))
    F = C
    for j in range(M):
        F += A[j] * B[j]
    if F > 0:
        ret += 1

print(ret)

Solution (Python):
import numpy as np

N, M, C = map(int, input().split())
B = np.array(list(map(int, input().split())))
A = []
ans = 0
for n in range(N):
    a = np.array(list(map(int, input().split())))
    if np.dot(a, B) + C > 0:
        ans += 1

print(ans)

Solution (Python):
n,m,c = map(int, input().split())
b=list(map(int, input().split()))
a=[]
for _ in range(n):
  a.append(list(map(int, input().split())))

ans=0
for ai in a:
  score=c
  for aij, bj in zip(ai, b):
    score+=aij*bj
  if score>0:
    ans+=1
print(ans)

Solution (Python):
N,M,C = map(int,input().split())
B = list(map(int, input().split()))
A = [0 for i in range(N)]
for j in range(N):
    A[j] = list(map(int,input().split()))

ans = 0
for k in range(N):
    score = C
    for l in range(M):
        score += A[k][l] * B[l]
    if score > 0:
        ans += 1

print(ans)

Solution (Python):
from sys import stdin

N, M, C = [int(x) for x in stdin.readline().rstrip().split()]
B = [int(x) for x in stdin.readline().rstrip().split()]
cnt = 0
for i in range(N):
    if sum([int(x)*B[j] for j, x in enumerate(stdin.readline().rstrip().split())])+C > 0:
        cnt += 1
print(cnt)

Solution (Python):
n,m,c = map(int,input().split())
b = list(map(int,input().split()))
count = 0
for i in range(n):
  a = list(map(int,input().split()))
  d = sum(ai*bi for ai,bi in zip(a,b)) 
  if d+c >0:
    count += 1
print(count)

Solution (Python):
n,m,c = map(int,input().split())
B = list(map(int,input().split()))
ans = 0
for i in range(n):
  A = list(map(int,input().split()))
  q = c
  for j in range(m):
    q += A[j]*B[j]
  if q > 0:
    ans += 1

print(ans)

Solution (Python):
n,m,c=map(int,input().split())
a=list(map(int,input().split()))
tans=0
for s in range(n):
    b=list(map(int,input().split()))
    ans=0
    for t in range(m):
        ans+=a[t]*b[t]
    if ans+c>0:
        tans+=1
print(tans)

Solution (Python):
N,M,C=map(int,input().split())
B=list(map(int,input().split()))
num=0
for i in range(N):
    A=list(map(int,input().split()))
    k=0
    for j in range(M):
        k+=A[j]*B[j]
    if k+C>0:
        num+=1
print(num)

Solution (Python):
N,M,C = map(int, input().split())
b_list = list(map(int, input().split()))
ans=0
for i in range(N):
  a_list = list(map(int, input().split()))
  atai=C
  for j in range(M):
    atai+=a_list[j]*b_list[j]
  if atai>0:
    ans+=1
print(ans)

Solution (Python):
N, M, C = map(int, input().split())
B = [int(x) for x in input().split()]
cnt = 0
for i in range(N):
  S = sum([int(x) * B[i] for i, x in enumerate(input().split())]) + C
  cnt += 1 if S > 0 else 0
print(cnt)

Solution (Python):
n, m, c = map(int, input().split())
bb = list(map(int, input().split()))
ans = 0

for i in range(n):
  aa = list(map(int, input().split()))
  val = c
  for a, b in zip(aa, bb):
    val += a * b
  if val > 0:
    ans += 1

print(ans)

Solution (Python):
N,M,C = map(int,input().split())
B = list(map(int,input().split()))

count = 0
for _ in range(N):
    A = list(map(int,input().split()))
    count += 1 if sum([a*b for a,b in zip(A,B)])+C > 0 else 0

print(count)