Problem: Mr. Dango's family has an extremely huge number of members. Once it had about 100 members, and now it has as many as population of a city. It is jokingly guessed that the member might fill this planet in the near future.

Mr. Dango's family, the huge family, is getting their new house. Scale of the house is as large as that of town.

They all had warm and gracious personality and were close each other. However, in this year the two members of them became to hate each other. Since the two members had enormous influence in the family, they were split into two groups.

They hope that the two groups don't meet each other in the new house. Though they are in the same building, they can avoid to meet each other by adjusting passageways.

Now, you have a figure of room layout. Your task is written below.

You have to decide the two groups each room should belong to. Besides you must make it impossible that they move from any rooms belonging to one group to any rooms belonging to the other group. All of the rooms need to belong to exactly one group. And any group has at least one room.

To do the task, you can cancel building passageway. Because the house is under construction, to cancel causes some cost. You'll be given the number of rooms and information of passageway. You have to do the task by the lowest cost.

Please answer the lowest cost.

By characteristics of Mr. Dango's family, they move very slowly. So all passageways are escalators. Because of it, the passageways are one-way.

Constraints

* 2 ≤ n  ≤ 100
* -10,000 ≤ Ci ≤ 10,000
* Y1 ... Ym can't be duplicated integer by each other.

Input

The input consists of multiple datasets. Each dataset is given in the following format.


n m
X1 Y1 C1
...
Xm Ym Cm


All numbers in each datasets are integers. The integers in each line are separated by a space.

The first line of each datasets contains two integers. n is the number of rooms in the house, m is the number of passageways in the house. Each room is indexed from 0 to n-1.

Each of following  m  lines gives the details of the passageways in the house. Each line contains three integers. The first integer Xi is an index of the room, the starting point of the passageway. The second integer Yi is an index of the room, the end point of the passageway. The third integer Ci is the cost to cancel construction of the passageway. The passageways, they are escalators, are one-way. The last dataset is followed by a line containing two zeros (separated by a space).

Output

For each dataset, print the lowest cost in a line. You may assume that the all of integers of both the answers and the input can be represented by 32 bits signed integers.

Example

Input

3 2
0 1 2
1 2 1
2 1
0 1 100
2 1
0 1 0
2 1
0 1 -1
0 0


Output

1
100
0
-1

Solution (in CPP):

Solution:
#include<queue>
#include<cstdio>

#define rep(i,n) for(int i=0;i<(n);i++)

using namespace std;

const int INF=1<<29;

template<class T>
struct AdjMatrix:public vector< vector<T> >{
	AdjMatrix(int n,const vector<T> &v=vector<T>()):vector< vector<T> >(n,v){}
};

template<class T>
T augment(const AdjMatrix<T> &capa,int src,int snk,AdjMatrix<T> &flow){
	int n=capa.size();
	vector<int> parent(n,-1); parent[src]=-2;

	T water=0;
	queue< pair<T,int> > qu; qu.push(make_pair(INF,src));
	while(!qu.empty()){
		pair<T,int> a=qu.front(); qu.pop();
		int u=a.second;
		T w=a.first;
		if(u==snk){ water=w; break; }
		rep(v,n) if(parent[v]==-1 && capa[u][v]-flow[u][v]>0) {
			qu.push(make_pair(min(w,capa[u][v]-flow[u][v]),v));
			parent[v]=u;
		}
	}

	if(water==0) return 0;

	for(int v=snk,u=parent[snk];v!=src;v=u,u=parent[u]){
		flow[u][v]+=water;
		flow[v][u]-=water;
	}

	return water;
}

template<class T>
T FordFulkerson(const AdjMatrix<T> &capa,int src,int snk){
	int n=capa.size();
	AdjMatrix<T> flow(n,vector<T>(n));

	T ans=0;
	while(1){
		T water=augment(capa,src,snk,flow);
		if(water==0) break;
		ans+=water;
	}
	return ans;
}

int main(){
	for(int n,m;scanf("%d%d",&n,&m),n;){
		int ans=0;
		AdjMatrix<int> adj(n,vector<int>(n));
		rep(i,m){
			int u,v,w; scanf("%d%d%d",&u,&v,&w);
			if(w<0) ans+=w;
			adj[u][v]=adj[v][u]=max(w,0);
		}

		int ans2=INF;
		rep(v,n) if(v!=0) ans2=min(ans2,FordFulkerson(adj,0,v));
		printf("%d\n",ans+ans2);
	}

	return 0;
}