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 = [list(map(int, input().split())) for i in range(N)]

count = 0

for row in A:
    cal = 0
    for col in enumerate(row):
        cal += col[1] * B[col[0]]
    cal += C
    if cal > 0:
        count += 1

print(count)

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

Solution (Python):

 
import math
import itertools
import sys
import copy
 





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


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):
n,m,c=map(int,input().split())
b=list(map(int,input().split()))
l=[]
ans=[]
cnt=0
for i in range(n):
	a=list(map(int,input().split()))
	l.append(a)
for i in range(n):
	sum=0
	for j in range(m):
		sum+=b[j]*l[i][j]
		if j==(m-1):
			sum+=c
			ans.append(sum)
for i in ans:
	if i>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)]
ans = 0
for i in range(N):
    if sum(a*b for (a,b) in zip(A[i],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):
    if sum(list([a*b for (a,b) in zip(A[i],B)]))+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()))
    sum_value = 0
    for i in range(M):
        sum_value += A[i]*B[i]
    if sum_value+C > 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()))
    tmp = c
    for j,k in zip(a,b):
        tmp += j * k
    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)]

total = 0
ans = 0

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

Solution (Python):
import pprint
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())))

cnt = 0
for j in range(N):
    calc_result = 0
    for k in range(M):
        calc_result += A[j][k] * B[k]
    calc_result += C
    if calc_result > 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)]
buf=0
for i in range(n):
    a_sum=0
    for j in range(m):
        a_sum+=a[i][j]*b[j]
    a_sum+=c
    if a_sum>0:
        buf+=1
    else:
        continue
print(buf)

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()))
    if sum(a*b for a,b in zip(A,B))+c>0: x+=1
print(x)

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())))
ans = 0
for i in range(N):
    tmp = 0
    for j in range(M):
        tmp += a[i][j] * b[j]
    if 0 < tmp + C:
        ans += 1
print(ans)

Solution (Python):

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

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

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

ans = []
for A in As:
    ans.append(sum([a * B for a, B in zip(A, Bs)]) + C > 0)
print(sum(ans))

Solution (Python):
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
def input():
    return sys.stdin.readline().rstrip()

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()))
        tmp=C
        for i in range(M):
            tmp+=A[i]*B[i]
        if tmp>0:
            ans+=1
    print(ans)

if __name__ == '__main__':
    main()

Solution (Python):
N,M,C = map(int,input().split())
B = list(map(int,input().split()))
R = 0
for _ in range(N):
    S = 0
    I = list(map(int,input().split()))
    for x in range(M):
        S += I[x] * B[x]
    if S + C > 0:
        R += 1
print(R)

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()))
  cnt += int(sum([A[i] * B[i] for i in range(M)], C) > 0)
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)]

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

for i in range(N):
  tmp=0
  A[i]= list(map(int,input().split()))
  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()))
A = [0] * 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):
import numpy as np
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()))
  if sum(np.array(a)*np.array(b)) + 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)]

sum1=0
ans=0
for i in range(n):
    for j in range(m):
        sum1+=a[i][j]*b[j]
    sum1+=c
    if sum1>0:
        ans+=1
    sum1=0
print(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_i = list(map(int, input().split()))
    A.append(A_i)
A = np.array(A)


ans = list((A.dot(B)) > -C).count(True)

print(ans)

Solution (Python):
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)]

	
	ans = 0
	ans_sum = 0
	for n_i in range(n):
		
		for m_i in range(m):
			ans_sum += a[n_i][m_i] * b[m_i]
		if ans_sum > -1*c:
			ans += 1
		ans_sum = 0
	print(ans)



 
if __name__ == '__main__':
	main()

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

def mull(Ai):
    res = C
    for i in range(M):
        res += Ai[i] * B[i]
    return res

for i in range(N):
    Ai = list(map(int,input().split()))
    if mull(Ai) > 0:
        res += 1

print(res)

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

Solution (Python):
nmc=list(map(int,input().split()))
b=list(map(int,input().split()))
a=[]
ans=0
for i in range(nmc[0]):
    a.append(list(map(int,input().split())))

for i in range(nmc[0]):
    x=nmc[2]
    for j in range(nmc[1]):
        x+=a[i][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,list(input().split()))) for i in range(n)]

ans=0
for i in range(n):
    sum = 0
    for j in range(m):
        sum += a[i][j] * b[j]
    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 _ in range(N)]
ans = 0
for Ai in A:
    r = C
    for a, b in zip(Ai, B):
        r += a * b
    if r > 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)]

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

print(cnt)

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()))
    res=0
    for i,j in zip(a,b):
        res += i*j
    if res+c > 0:
        cnt+=1
print(cnt)

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=0
  for j in range(M):
    sum += A[j]*B[j]
  sum += C  
  if sum > 0:
    cnt+=1
print(cnt)

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

B = list(map(int, input().split()))
num = 0
for _ in range(n):
    A = list(map(int, input().split()))
    total = 0
    for i in range(m):
        total += A[i] * B[i]
    if total + c > 0:
        num += 1
print(num)

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

for i in A:
    tmp = 0
    for a, b in zip(i, B):
        tmp += a * b
    tmp += C
    if tmp > 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 = map(int,input().split())
    suma = 0
    for j in zip(A,B):
        suma += j[0]*j[1]
    if suma + 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 _ in range(n)]
lst = []
tmp = 0

for i in range(n):
    
    x = c
    for j in range(m):
        x += a[i][j]*b[j]
    lst.append(x)

for i in range(n):
    if lst[i] > 0:
        tmp += 1

print(tmp)

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(0, n)]

ans = 0
for i in range(0, n):
  s = c
  for j in range(0, 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())))
A=np.array([list(map(int,input().split())) for i in range(N)])
cnt=0
for i in range(N):
    if (A[i]*B).sum()+C>0:
        cnt+=1
print(cnt)

Solution (Python):
import bisect
import cmath
import heapq
import itertools
import math
import operator
import os
import re
import string
import sys
from collections import Counter, deque, defaultdict
from copy import deepcopy
from decimal import Decimal
from fractions import gcd
from functools import lru_cache, reduce
from operator import itemgetter, mul, add, xor

import numpy as np

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7



N, M, C = list(map(int, sys.stdin.buffer.readline().split()))
B = list(map(int, sys.stdin.buffer.readline().split()))
A = [list(map(int, sys.stdin.buffer.readline().split())) for _ in range(N)]

B = np.array(B, dtype=int)
A = np.array(A, dtype=int)


ok = np.dot(A, B) + C > 0
print(ok.sum())

Solution (Python):
import bisect
import cmath
import heapq
import itertools
import math
import operator
import os
import re
import string
import sys
from collections import Counter, deque, defaultdict
from copy import deepcopy
from decimal import Decimal
from fractions import gcd
from functools import lru_cache, reduce
from operator import itemgetter, mul, add, xor

import numpy as np

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7



N, M, C = list(map(int, sys.stdin.buffer.readline().split()))
B = list(map(int, sys.stdin.buffer.readline().split()))
A = [list(map(int, sys.stdin.buffer.readline().split())) for _ in range(N)]

B = np.array(B, dtype=int)
A = np.array(A, dtype=int)

ok = (A * B).sum(axis=1) + C > 0
print(ok.sum())

Solution (Python):
import numpy as np

N, M, C = map(int, input().split())
B = np.array(input().split(), dtype=np.int32)
A = np.array([list(map(int, input().split())) for _ in range(N)])

p = np.sum(A * B, axis=-1) + C
print(np.count_nonzero(p > 0))

Solution (Python):
N = list(map(int,input().split()))
n = list(map(int,input().split()))
cnt = 0
for i in range(N[0]):
	sub = list(map(int,input().split()))
	sum = 0
	for j in range(N[1]):
		sum+=n[j]*sub[j]
	sum+=N[2]
	if(sum>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)]

cnt = 0

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

Solution (Python):
import numpy as np

N, M, C = [int(i) for i in input().split()]
B = [int(i) for i in input().split()]
A = [[int(i) for i in input().split()] for _ in range(N)]
A = np.array(A)
B = np.array(B).reshape(-1, 1)

ans = (np.dot(A, B) + C > 0).sum()
print(ans)

Solution (Python):
from functools import reduce

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 reduce(lambda x, y:x + y[0] * y[1], zip(A, B), 0) + C > 0: ans += 1
print(ans)

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

    ans = 0
    for i in range(N):
        t = 0
        for a, b in zip(A[i], B):
            t += a * b
        if 0 < t + C:
            ans += 1
    print(ans)


if __name__ == '__main__':
    solve()

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()))
    temp_ans = 0
    for j in range(m):
        temp_ans += A[j] * B[j]
    temp_ans += c
    if temp_ans > 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, Ai in enumerate(A):
    tmp = sum([Aij * Bj for Aij, Bj in zip(Ai, 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()))

cnt = 0
sum_lst = 0
for i in range(n):
    for j in range(m):
        sum_lst += A[i][j] * B[j] 
    if sum_lst + c > 0:
        cnt += 1
        sum_lst = 0
    else:
        sum_lst = 0

print(cnt)

Solution (Python):
N, *L,  = [list(map(int, s.split())) for s in open(0)]
A = L[:1][0]
B = L[1:]
cnt = 0
for b in B:
    c = 0
    for i in range(len(b)):
        c += A[i]*b[i]
    if c + N[2] > 0:
        cnt += 1
print(cnt)

Solution (Python):
import math

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

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

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

ans=0

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

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

Solution (Python):
N,M,C = list(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 = C
  for j in range(M):
    tmp += A[i][j]*B[j]
  if tmp > 0:
    ans += 1
print(ans)

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

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]
    tmp += c
    if tmp > 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()]
cnt = 0
for a in range(n):
	a = [int(i) for i in input().split()]
	tmp = sum([bb * aa for bb, aa in zip(b, a)]) + c
	if tmp > 0:
		cnt += 1
print (cnt)

Solution (Python):
N, M, C = [int(s) for s in input().split(' ')]
Bs = [int(s) for s in input().split(' ')]
count = 0
for n in range(N):
    An =  [int(s) for s in input().split(' ')]
    ret = C
    for a, b in zip(An, Bs):
        ret += a * b
    if ret > 0:
        count += 1

print(count)

Solution (Python):
import os, sys, re, math

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

print (count)

Solution (Python):
n, m, c = list(map(int, input().split(' ')))
bb = list(map(int, input().split(' ')))
ans = 0
for i in range(n):
    aa = list(map(int, input().split(' ')))
    hoge = sum([b*a for b, a in zip(bb, aa)])
    if hoge + c > 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 np.sum(np.multiply(a, b)) + c > 0:
        cnt += 1
print(cnt)

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

base_list = list(map(int, input().split()))

ans = 0
for i in range(n):
    cal = 0
    source_list = list(map(int, input().split()))

    for j in range(m):
        cal += base_list[j] * source_list[j]

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

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

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)]

def abc(aaa,bbb,c):
	tmp=sum([ai*bi for ai,bi in zip(aaa,bbb)])+c
	return tmp>0

count=0
for aaa in a:
	if abc(aaa,b,c):
		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()))
    if sum(a*b for a,b in zip(A,B))+C>0:count+=1
print(count)

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

for i in range(n):

   if sum(list(map(lambda a,b:a*b,a[i],b)))+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()))
    s=0
    for j in range(m):
        s+=a[j]*b[j]
    if s+c>0:
        cnt+=1
print(cnt)

Solution (Python):
import numpy as np
N, M, C = map(int, input().split())
b = np.array(tuple(map(int, input().split())))
A = np.asarray(tuple(np.array(tuple(map(int, input().split()))) for _ in range(N)))

print(((A.dot(b) + C) > 0).sum())

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

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

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

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

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

print(count)

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

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

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

Solution (Python):
n, m, c = map(int, input().split())
blis = list(map(int, input().split()))
count = 0
for i in range(n):
  cache = 0
  alis = list(map(int, input().split()))
  for i1 in range(len(blis)):
    cache += blis[i1] * alis[i1]
  cache += c
  if cache > 0:
    count += 1
print(count)

Solution (Python):
def multiple(list_a, list_b):
  ans = [0] * len(list_a)
  
  for i in range(len(list_a)):
    ans[i] = list_a[i] * list_b[i]
  
  return ans

n, m, c = [int(x) for x in input().split()]

b = [int(x) for x in input().split()]

count = 0
for _ in range(n):
  na = [int(x) for x in input().split()]
  if sum(multiple(na, b)) + c > 0:
    count += 1

print(count)

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

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

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

Solution (Python):
def p_b():
    n, m, c = map(int, input().split())
    *b, = map(int, input().split())
    ans = 0
    for i in range(n):
        *a, = map(int, input().split())
        tmp = c
        for _a, _b in zip(a, b):
            tmp += _a * _b
        if tmp > 0:
            ans += 1
    print(ans)
    
p_b()

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()))
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 = []
x = 0
ans = 0

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

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

print(ans)

Solution (Python):
L=lambda:map(int,input().split())
n,m,c=L()
b=list(L())
a=[list(L()) for _ in range(n)]
ans=0
for code in a:
    Sum=0
    for a_elm, b_elm in zip(code, b):
        Sum += a_elm*b_elm
    Sum += c
    if Sum>0:ans += 1
print(ans)

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(j) for j in input().split()]
    x = c
    for k in range(m):
        x += a[k] * b[k]
    if x > 0:
        ans += 1
print(ans)

Solution (Python):
n,m,c=map(int,input().split())
b=list(map(int,input().split()))
cou=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:
        cou+=1
print(cou)

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 A:
    if sum(b * a for (b, a) in zip(B, i)) + C > 0:
        ans += 1
print(ans)

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

count=0
for i in range(n):
  total=0
  temp=al[i]
  for j in range(m):
    total+=temp[j]*bl[j]
  if total+c>0:
    count+=1
print(count)

Solution (Python):
N, M, C = map(int, input().split())
B = list(map(int, input().split()))
res = 0
for n in range(N):
    A = list(map(int, input().split()))
    if -1*C < sum([a*b for a, b in zip(A, B)]):
        res += 1
print(res)

Solution (Python):
n,m,c = map(int,input().split())
b_ls = list(map(int,input().split()))
temp_sum = c
ans = 0
for i in range(n):
    a_ls = list(map(int,input().split()))
    temp_sum = c
    for j in range(m):
        temp_sum += a_ls[j] * b_ls[j]
    if temp_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 _ in range(N)]
ans = 0

for i in range(N):
  num = 0
  for j in range(M):
    num += b[j]*a[i][j]
  if num > (-1)*C:
    ans += 1

print(ans)

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()))
    if sum([ai*aj for ai, aj in zip(a, b)])+c > 0:
        res += 1
print(res)

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()]
A = []
ans = 0
for _ in range(N):
    A_ = [int(x) for x in stdin.readline().rstrip().split()]
    A.append(A_)
for i in range(N):
    A_ = A[i]
    cnt = C
    for j in range(M):
        cnt += A_[j] * B[j]
    if cnt > 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):
    A = list(map(int, input().split()))
    a_b = [b*a for b, a in zip(B, A)]
    if sum(a_b) + C > 0:
        count += 1
print(count)