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()))
ans = 0
for i in range(n):
  a = list(map(int,input().split()))
  x = c
  for j in range(m):
    x += a[j]*b[j]
  if x > 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 i in range(N):
    tmp=0
    for a,b in zip(A[i],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 i in range(n)]
count=0
for i in range(n):
  sum=c
  for j in range(m):
    sum+=b[j]*a[i][j]
  if sum>0:
    count+=1
print(count)

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):
    sum = 0

    for j in range(m):
        sum += a[i][j] * b [j]

    if sum + c > 0:
        ans += 1


print(ans)

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

Solution (Python):
import sys
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
mod = 10 ** 9 + 7

n, m, c = LI()
b = LI()
a = LIR(n)
ans = 0

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

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

code_count = 0
answer = 0

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

print(answer)

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

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

    if sum>0:
        cnt+=1

print(cnt)

Solution (Python):
from operator import mul
ans = 0

N, M, C = map(int, input().split())
X = [list(map(int, input().split())) for i in range(N + 1)]

for i in range(N):  
  num = list(map(mul, X[0],X[i+1]))
  add = sum(num) + C
  if add > 0:
    ans += 1

print(ans)

Solution (Python):
from typing import List


def judge(c: int, m: int, b: List[int], a: List[int]) -> bool:
    result = c
    for i in range(m):
        result += a[i] * b[i]

    return 0 < result


def answer(n: int, m: int, c: int, b: List[int], a: List[List[int]]) -> int:
    count = 0
    for i in range(n):
        if judge(c, m, b, a[i]):
            count += 1

    return count


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

    print(answer(n, m, c, b, a))


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 _ in range(n)]

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

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

cnt = 0
for a in range(N):
    math_list = []
    for b in range(M):
        math_list.append(A[a][b] * B[b])
    if sum(math_list) + C > 0:
        cnt += 1

print(cnt)

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

Solution (Python):
n,m,c = map(int, input().split())
b = list(map(int, input().split()))
a = []
d = 0
for i in range(n):
    a.append(list(map(int, input().split())))
    combined1 = [x * y for (x, y) in zip(a[i], b)]
    if sum(combined1) + c > 0:
        d += 1

print(d)

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

def ans121(N:int, M:int, C:int, B:str, A:list):
    B=list(map(int,B.split()))
    judge_count=0
    for i in range(N):
        A_list=list(map(int,A[i].split()))
        math_count=0
        for j in range(M):
           math_count+=B[j]*A_list[j]
        if math_count+C>0:
           judge_count+=1
    return judge_count

print(ans121(N,M,C,B,A))

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

for i in range(n):
    a = list(map(int, input().split()))
    tmp = sum([a_ * b_ for (a_, 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 = [list(map(int, input().split())) for _ in range(N)]
ans = 0
ANS = []
ct = 0
for i in range(N):
    for j in range(M):
        ans += A[i][j] * B[j]
        if j == M-1:
            ANS.append(ans)
            ans = 0
for x in ANS:
    if x + C > 0:
        ct += 1
print(ct)

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 = []
val = 0
for arr in a:
    for s in range(m):
        val += arr[s]*b[s]
        if s == m-1:
            ans.append(val)
            val = 0
ans = list(map(lambda x: x + c, ans))
print(sum(l > 0 for l in 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[i] * b[i] for i in range(m)]) + 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 i in range(N):
    y = 0
    for j in range(M):
        y += A[i][j]*B[j]
    y += C

    if y > 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())))

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):
a = list(map(int,input().split()))
b = list(map(int,input().split()))
c = []
ans = 0
e = 0
for i in range(a[0]):
  d = list(map(int,input().split()))
  c .append(d)
for i in c:
  for j in range(a[1]):
    e += b[j]*i[j]
    
  if e + a[2] > 0:
    ans += 1
  e = 0
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()))
    x=C
    for i in range(M):
        x+=A[i]*B[i]
    if x>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()))
  count = 0
  for j in range(m):
    count += b[j]*a[j]
  if count+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()))
  tmp = 0
  for j in range(M):
    tmp += A[j] * B[j]
  if tmp > -C:
    ans += 1
print(ans)

Solution (Python):

import sys


def solve(N: int, M: int, C: int, B: "List[int]", A: "List[List[int]]"):
    ans = 0
    for i in range(N):
        t = C
        for j in range(M):
            t += A[i][j] * B[j]
        if t > 0:
            ans += 1
    print(ans)

    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  
    M = int(next(tokens))  
    C = int(next(tokens))  
    B = [int(next(tokens)) for _ in range(M)]  
    A = [[int(next(tokens)) for _ in range(M)] for _ in range(N)]  
    solve(N, M, C, B, A)

if __name__ == '__main__':
    main()

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

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

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

Solution (Python):

def check(B, C):
    A = list(map(int, input().split()))
    s = 0
    for i, a in enumerate(A):
        s += a * B[i]
    s += C
    if s > 0:
        return True
    else:
        return False


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

    ans = 0
    for _ in range(N):
        if check(B, C):
            ans += 1
    print(ans)
resolve()

Solution (Python):
n, m, c = map(int, 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()]
    cnt = c
    for aa, bb in zip(a, b):
        cnt += aa * bb
    if cnt > 0: ans += 1
print(ans)

Solution (Python):
def main():
    n, m, c = map(int, input().split())
    b = list(map(int, input().split()))
    a = []

    cnt = 0
    for i in range(n):
        a.append(list(map(int, input().split())))

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


if __name__ == '__main__':
    main()

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

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

print(ans)

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

cnt = 0

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

print(cnt)

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

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

Solution (Python):

def input2():
	return map(int,input().split())


def input_array():
	return list(map(int,input().split()))
  
n,m,c=input2()
B=input_array()
A=[input_array() for _ in range(n)]

count=0

for a in A:
	tmp=c
	for i in range(m):
		tmp+=a[i]*B[i]

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

Solution (Python):
def mapt(fn, *args):
    return tuple(map(fn, *args))


def Input():
    return mapt(int, input().split(" "))


def main():
    n, m, c = Input()
    b = Input()
    a = [Input() for _ in range(n)]
    ans = 0
    for row in a:
        tmp = c
        for x, y in zip(row, b):
            tmp += x * y
        if tmp > 0:
            ans += 1
    print(ans)

main()

Solution (Python):
n, m, c = map(int, input().split())
b = list(map(int, input().split()))
a = [list(map(int, input().split())) for l in range(n)]
ans = 0
for i in range(n):
    sum = c
    for j in range(m):
        sum += b[j]*a[i][j]
    if(sum > 0):
        ans = 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)]

cnt=0
sum=0

for i in range(m):
  for j in range(n):
    sum+=b[i]*a[j][i]

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

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

result = []

for i in range(N):
    cnt = C
    for j in range(M):
        cnt += A[i][j]*B[j]
    
    if cnt > 0:
        result.append(1)
    else:
        result.append(0)

print(sum(result))

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

for i in range(n):
    a.append(list(map(int,input().split())))
    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()))
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:
    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)]

cnt = 0
for n in range(N):
    value = 0
    for m in range(M):
        value += A[n][m]*B[m]
    value += C
    if value > 0:
        cnt += 1

print(cnt)

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()))
  tmp = 0
  for j in range(M):
    tmp += A[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()))
a = [list(map(int,input().split())) for i in range(n)]
count = 0
tmp = 0
for i in range(n):
    for j in range(m):
        tmp += a[i][j] * b[j]
    count += 1 if tmp + c > 0 else 0
    tmp = 0
print(count)

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:
  s=c
  for i in range(m):
    s += a[i]*B[i]
  if s>0:
    ans += 1
print(ans)

Solution (Python):

import sys
input=sys.stdin.readline

def main():
    n,m,c = map(int,input().split())
    base_data=[]
    source_codes=[]
    base_data=list(map(int,input().split()))
    source_codes=[list(map(int,input().split())) for _ in range(n)]
    ans=0
    cnt=0

    for i in range(n):
        for j in range(m):
            ans+=source_codes[i][j]*base_data[j]
        ans=ans+c
        if ans > 0:
            ans=0
            cnt+=1
        else:
            ans=0
            continue
    
    print(cnt)    
    
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):
    if sum([a[i][j]*b[j] for j in range(m)]) + c > 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()))
    S=0
    for j in range(M):
        S+=A[j]*B[j]
    if S>-C:
        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 i in range(N):
    tmp = 0
    for j in range(M):
        tmp += A[i][j]*B[j]
    ans = ans+1 if tmp+C>0 else ans
print(ans)

Solution (Python):
n, m, c = map(int, input().split(" "))
b_arr = list(map(int, input().split(" ")))
ans = 0
a_arr = []
for _ in range(n):
    a_arr = list(map(int, input().split(" ")))
    sum_num = c

    for i in range(m):
        sum_num += a_arr[i] * b_arr[i]

    if sum_num > 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 _ in range(N):
    A = np.array(list(map(int,input().split())))
    if np.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 i in range(n)]

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

print(ans)

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

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

Solution (Python):

n,m,c = map(int,input().split())
b_list = list(map(int,input().split()))
a_list =[]
for i in range(n):
    a_list.append(list(map(int,input().split())))

ret_num = 0
sum = 0

for N in range(n):
    sum = 0
    for M in range(m):
        sum += a_list[N][M] * b_list[M]
    if sum + c > 0:
        ret_num += 1

print(ret_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 = c + sum([a*b for a, b in zip(A, B)])
    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 i in range(n):
    A = list(map(int, input().split()))
    s = c
    for a, b in zip(A, B):  s += a*b
    if s > 0:  ans += 1

print(ans)

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

    for i in range(n):
        tmp_sum = 0
        for j in range(m):
            tmp_sum += a_list[i][j] * b_list[j]
        if tmp_sum + c > 0:
            cnt += 1

    print(cnt)


if __name__ == "__main__":
    main()

Solution (Python):
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()))
  val = sum([a*b for a,b in zip(A,B)])
  if val > -C:
    cnt += 1
    
print(cnt)

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

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

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

def a_x_b(ab):
  a, b = ab
  return a*b

for n in range(N):
  A[n] = list(map(int, input().split()))
  AB = [(A[n][i], B[i]) for i in range(M)]
  if sum(list(map(a_x_b, AB)))+C > 0:
    count += 1
  else:
    continue
    
print(count)

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

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

Solution (Python):


n, m, c = map(int, input().split())
total = 0
count = 0
b_point = input().split()
b_table = [int(k) for k in b_point]
for i in range(n):
    total = 0
    a_point = input().split(" ")
    a_table = [int(m) for m in a_point]
    for j in range(m):
        total += b_table[j] * a_table[j]
        if j == m - 1:
            total += c
            if total > 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 = d + a[j]*b[j]
    if d+c > 0:
        ans = ans + 1
print(ans)

Solution (Python):
from sys import stdin
 
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 = d + a[j]*b[j]
    if d+c > 0:
        ans = 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()))
  tmp = 0
  for i,j in zip(B,A):
    tmp += i*j
  if tmp + C > 0:
    ans += 1
print(ans)

Solution (Python):
from sys import stdin

n,m,c = map(int, input().split())
B = list(map(int, input().split()))
ALines = stdin.readlines()

print(sum([1 for A in ALines if sum([a*b for a,b in zip(list(map(int, A.split())),B)]) + c > 0]))

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()))
  tmp=0
  for j in range(m):
    tmp += a[j]*b[j]
  tmp += c
  if tmp > 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 i in range(n)]
d=-1000
x=0
for i in range(n):
  d=0
  for j in range(m):
    d+=a[i][j]*b[j]
  if d+c>0:
    x+=1
print(x)

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

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

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)]
d = -1000
x = 0
for i in range(n):
    d = 0
    for j in range(m):
        d += a[i][j]*b[j]
    if d+c>0:
        x+=1
print(x)

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)]
d = -1000
x = 0
for i in range(n):
    d = 0
    for j in range(m):
        d += a[i][j]*b[j]
    else:
        if d+c>0:
            x+=1
print(x)

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)]
d = -1000
x = 0
for i in range(n):
    d = 0
    for j in range(m):
        d += a[i][j]*b[j]
    else:
        if d+c>0:
            x+=1
print(x)

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

i = 0
for a in A:
  s = 0
  for x, y in zip(a, B):
    s += int(x) * y

  if s + C > 0:
    i += 1
  else:
    pass


print(i)

Solution (Python):
a = input("").split(" ")
a = [int(aa) for aa in a]
b = input("").split(" ")
b = [int(bb) for bb in b]
Al = []
N = a[0]
C = a[2]
ans = 0
for aaa in range(N):
    al = input("").split(" ")
    al = [int(aal) for aal in al]
    Al.append(al)
for c in Al:
    n = 0
    i = 0
    for d in c:
        n += d*b[i]
        i += 1
    if n+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()))
  p = C
  for j in range(M):
    p += a[j] * B[j]
  if p > 0:
    ans += 1
print(ans)

Solution (Python):
n,m,c = map(int,input().split())
b = [int(x.strip()) for x in input().split()]
a = []
ans = 0
for i in range(n):
  ai = [int(x.strip()) for x in input().split()]
  a.append(ai)
for j in range(n):
  ch = [x*y for (x,y) in zip(a[j],b)]
  ch_sum = sum(ch)
  if ch_sum + c > 0:
    ans += 1
print(ans)

Solution (Python):
n, m, c = map(int, input().split())
lis_b = list(map(int, input().split()))
ans = 0
for _ in range(n):
  goukei = 0
  lis_a = list(map(int, input().split()))
  for a, b in zip(lis_a, lis_b):
    goukei += a * b
  goukei += c
  if goukei > 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()))
  AB = 0
  for j in range(M):
    AB += A[j] * B[j]
  if AB + 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 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()))
ans=0
for i in range(N):
  A=list(map(int,input().split()))
  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=list(map(int,input().split()))
ans=0
for i in range(N):
    if sum(map(lambda x,y: int(x)*y, input().split(),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)]
ans = 0
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(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 i in range(m):
        ans+=a[i]*b[i]
    if ans+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()))
  d = 0
  for j in range(m):
    d += A[j]*B[j]
  d += c
  if d > 0:
    count += 1
print(count)

Solution (Python):
l = list(map(int, input().split()))
n = l[0]
m = l[1]
c = l[2]

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


num_correct = 0

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

print(num_correct)

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

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

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

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

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

Solution (Python):
"""Boot-camp-for-Beginners_Easy005_B_Can-you-solve-this_25-August-2020.py"""

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

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

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()))
    ab = [x*y for x,y in zip(a,b)]
    if sum(ab) + 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())))
sum = 0
for _ in range(N):
    A=np.array(list(map(int,input().split())))
    if np.sum(A*B) + C > 0:
        sum += 1

print(sum)

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

Solution (Python):
N,M,C = map(int,input().split())
Bls = list(map(int,input().split()))
ii = 0
for i in range(N):
    sum1 = 0
    Als = list(map(int,input().split()))
    for j in range(M):
        sum1 += Bls[j]*Als[j]
    if sum1 + C > 0:
        ii += 1
print(ii)

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

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

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

ac = 0

for _ in range(n):
	res = c
	a = list(map(int, input().split()))
	for x, y in zip(a, b):
		res += x * y
	
	if res > 0:
		ac += 1

print(ac)

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