#include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
#include <set>

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,j) FOR(i,0,j)
#define mp std::make_pair

const int INF = 1 << 24;
const int dx[8] = {0, 0, 1, -1, 1, 1, -1, -1}, dy[8] = {1, -1, 0, 0, 1, -1, 1, -1};

typedef unsigned long long ull;
typedef std::pair<int,int> P;

int main(){
    int N, K;
    while(std::cin >> N >> K, N){
        int S[100];
        REP(i, K){
            std::cin >> S[i];
        }

        bool canHave = true;
        REP(i, N){
            REP(j, K){
                int b;
                std::cin >> b;
                S[j] -= b;
                if(S[j] < 0){canHave = false;}
            }
        }

        if(canHave){puts("Yes");}
        else{puts("No");}
    }
}