#include <bits/stdc++.h>
using namespace std;
const int Maxm=10205;
const int Maxn=205;
const int inf=1e9;
int n,m,s,t,size=1,ans,flag,tot,sum;
int first[Maxn],tmp[Maxn],in[Maxn],out[Maxn],depth[Maxn],f[Maxm];
struct shu{int from,to,next,len;};
shu edge[Maxm<<3];
inline int get_int()
{
int x=0,f=1;
char c;
for(c=getchar();(!isdigit(c))&&(c!='-');c=getchar());
if(c=='-') {f=-1;c=getchar();}
for(;isdigit(c);c=getchar()) x=(x<<3)+(x<<1)+c-'0';
return x*f;
}
inline void build(int x,int y,int z)
{
edge[++size].next=first[x];
first[x]=size;
edge[size].from=x;
edge[size].to=y;
edge[size].len=z;
}
inline void pre()
{
t=n+1;
for(int i=1;i<=n;i++)
{
int num=in[i] - out[i];
if(num > 0) build(s,i,num),build(i,s,0),sum+=num;
if(num < 0) build(i,t,abs(num)),build(t,i,0);
}
}
inline int bfs()
{
memset(depth,0,sizeof(depth));
queue<int>q;
q.push(s);
depth[s]=1;
while(!q.empty())
{
int point=q.front();
q.pop();
for(register int u=first[point];u;u=edge[u].next)
if(edge[u].len&&!depth[edge[u].to])
{
depth[edge[u].to]=depth[point]+1;
q.push(edge[u].to);
if(edge[u].to==t) return 1;
}
}
return 0;
}
inline int mn(int x,int y){return x < y ? x : y;}
inline int dinic(int point,int flow)
{
if(point==t) return flow;
int sum=0;
for(int &u=tmp[point];u&&sum<flow;u=edge[u].next)
{
int to=edge[u].to;
if(depth[to] == depth[point] + 1 && edge[u].len)
{
int minn=dinic(to,mn(edge[u].len,flow-sum));
if(!(flow-sum)) {depth[to]=0;break;}
edge[u].len-=minn;
edge[u^1].len+=minn;
sum+=minn;
}
}
return sum;
}
int main()
{
n=get_int(),m=get_int();
for(int i=1;i<=m;i++)
{
int x=get_int(),y=get_int(),low=get_int(),up=get_int();
in[y]+=low,out[x]+=low,f[i]=low;
build(x,y,up-low),build(y,x,0);
}
tot=size;
pre();
while(bfs())
{
memcpy(tmp,first,sizeof(first));
ans += dinic(s,inf);
}
if(ans==sum)
{
cout<<"YES\n";
for(int i=2;i<=tot;i+=2) cout<<edge[i^1].len+f[i/2]<<"\n";
}
else cout<<"NO\n";
return 0;
}