#include <bits/stdc++.h>
using namespace std;

typedef long long ll; typedef unsigned long long ull;
const int inf = 1e9; const ll llnf = 4e18;

template< class Tp > void chkmax( Tp &x , Tp y ) { x = max( x , y ); }
template< class Tp > void chkmin( Tp &x , Tp y ) { x = min( x , y ); }

void solve( ) {
	int n , k; cin >> n >> k;
	vector< int > a( n + 1 ); for( int i = 1; i <= n; i ++ ) cin >> a[i];
	vector< ll > b( k + 2 ); for( int j = 1; j <= k; j ++ ) cin >> b[j]; b[k + 1] = llnf;
	vector< ll > sa( n + 1 ); for( int i = 1; i <= n; i ++ ) sa[i] = sa[i - 1] + a[i];

	vector< vector< pair< ll , int > > > B( k + 2 );
	for( int i = k + 1; i >= 1; i -- ) {
		vector< int > ord; for( int j = i; j <= k + 1; j ++ ) ord.emplace_back( j );
		sort( ord.begin( ) , ord.end( ) , [&] ( int j1 , int j2 ) -> bool { return b[j1] < b[j2]; } );
		int minj = k + 1; for( int j = ( int ) ord.size( ) - 1; j >= 0; j -- ) chkmin( minj , ord[j] ) , B[i].emplace_back( b[ord[j]] , minj ); reverse( B[i].begin( ) , B[i].end( ) );
	}

	auto least = [&] ( int j , ll v ) -> int { return lower_bound( B[j].begin( ) , B[j].end( ) , make_pair( v , -1 ) ) -> second; } ;

	vector< vector< int > > f( n + 1 , vector< int >( n + 1 ) ) , g1( n + 1 , vector< int >( n + 1 ) ) , g2( n + 1 , vector< int >( n + 1 ) );
	for( int i = 1; i <= n; i ++ ) f[i][i] = 0 , g1[i][i] = i , g2[i][i] = i;
	for( int L = n; L >= 1; L -- ) for( int R = L + 1; R <= n; R ++ ) {
		int f1 = least( 1 , sa[R] - sa[L] ); g1[L][R] = L;
		for( int M = max( L , g1[L][R - 1] - 2 ); M <= min( R - 1 , g1[L + 1][R] + 2 ); M ++ )
			if( f[L][M] <= k ) { int curf = least( f[L][M] + 1 , sa[R] - sa[M] ); if( f1 > curf ) f1 = curf , g1[L][R] = M; }
		for( int M = max( L , g2[L][R - 1] - 2 ); M <= min( R - 1 , g2[L + 1][R] + 2 ); M ++ )
			if( f[L][M] <= k ) { int curf = least( f[L][M] + 1 , sa[R] - sa[M] ); if( f1 > curf ) f1 = curf , g1[L][R] = M; }

		int f2 = least( 1 , sa[R - 1] - sa[L - 1] ); g2[L][R] = R;
		for( int M = max( L + 1 , g2[L][R - 1] - 2 ); M <= min( R , g2[L + 1][R] + 2 ); M ++ )
			if( f[M][R] <= k ) { int curf = least( f[M][R] + 1 , sa[M - 1] - sa[L - 1] ); if( f2 > curf ) f2 = curf , g2[L][R] = M; }
		for( int M = max( L + 1 , g1[L][R - 1] - 2 ); M <= min( R , g1[L + 1][R] + 2 ); M ++ )
			if( f[M][R] <= k ) { int curf = least( f[M][R] + 1 , sa[M - 1] - sa[L - 1] ); if( f2 > curf ) f2 = curf , g2[L][R] = M; }

		f[L][R] = min( f1 , f2 );
	}
	cout << ( f[1][n] <= k ? "Yes" : "No" ) << "\n";
}

int main( ) {
	ios::sync_with_stdio( 0 ), cin.tie( 0 ), cout.tie( 0 );
	int T = 1; while( T -- ) solve( ); return 0;
}