Problem: Aizuwakamatsu City is known as the "City of History". About 400 years ago, the skeleton of the castle town was created by Gamo Ujisato, but after that, it became the central city of the Aizu clan 230,000 stones, whose ancestor was Hoshina Masayuki, the half-brother of Tokugawa's third shogun Iemitsu. Developed. Many tourists from all over the country visit every year because historic sites and remnants of old days still remain throughout the city.

This year, "Shinsengumi!" Is being broadcast in the NHK Taiga drama, so the number of tourists is increasing significantly as a place related to the Shinsengumi (* 1). Therefore, the city decided to install lanterns at intervals of 100 m along the streets connecting the historic sites scattered throughout the city. The condition is that you can reach all the historic sites in the city by following the streets decorated with lanterns, but you do not have to follow it with a single stroke. However, due to the limited budget, it is necessary to minimize the number of lanterns to be installed.

Create a program that reads the data on the street connecting the historic sites and outputs the minimum number of lanterns required. However, the distance between historic sites is greater than or equal to 200 m and is given in multiples of 100. The distance from each historic site to the nearest lantern is 100 m, and there are less than 100 historic sites in the city. There is no need to install a lantern on the historic site itself.

<image>


(* 1) The Shinsengumi was established in the form of the Aizu clan's entrustment, participated in the Aizu Boshin War known for the tragedy of Byakkotai, and Toshizo Hijikata built the grave of Isami Kondo at Tenningji Temple in the city.



Input

Given multiple datasets. Each dataset is given in the following format:


n
m
a1, b1, d1
a2, b2, d2
::
am, bm, dm


The first line of each dataset is given the number of historic sites n. It is then given a few meters of streets connecting the historic sites. The following m lines are given the three comma-separated numbers ai, bi, and di. ai and bi are historic site numbers. Historic sites are numbered from 0 to n-1. ai bi indicates that there is a street connecting them, and di represents the distance of the road between ai bi.

When n is 0, it is the last input. The number of datasets does not exceed 20.

Output

For each dataset, output the minimum number of lanterns required on one line.

Example

Input

4
4
0,1,1500
0,2,2000
1,2,600
1,3,500
0


Output

23

Solution (in JAVA):

Solution:
import java.util.Arrays;
import java.util.PriorityQueue;
import java.util.Queue;
import java.util.Scanner;


public class Main {
	
	public static class Path implements Comparable<Path>{
		private int to,from,len;
		
		public Path(int f,int t,int l){
			from = f;
			to = t;
			len = l;
		}
		
		public int get_from(){
			return from;
		}
		
		public int get_to(){
			return to;
		}
		
		public int get_len(){
			return len;
		}
		
		public int compareTo(Path p){
			return this.get_len() - p.get_len(); 	
		}
		
		public String toString(){
			return "From " + from + ". To " + to + ". len " + len +".";
		}
	}

	static class UnionFind {
		final int[] tree;
		int num;

		public UnionFind(int n) {
			this.tree = new int[n];
			Arrays.fill(tree, -1);
			num = n;
		}

		// merge the set contains x and the set contains y
		void union(int x, int y) {
			x = root(x);
			y = root(y);
			if (x != y) {
				if (tree[x] < tree[y]) {
					x ^= y;
					y ^= x;
					x ^= y;
				}
				tree[x] += tree[y];
				tree[y] = x;
				num--;
			}
		}

		// decide if x and y belong to the same set
		boolean find(int x, int y) {
			return root(x) == root(y);
		}

		int root(int x) {
			return tree[x] < 0 ? x : (tree[x] = root(tree[x]));
		}

		// return size of the set contains x
		int size(int x) {
			return -tree[root(x)];
		}

		// return the number of sets
		int getNum() {
			return num;
		}
	}

	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		
		while(true){
			int n = sc.nextInt();
			if(n == 0){break;}
			int m = sc.nextInt();
			
			Queue<Path> queue = new PriorityQueue<Path>();
			
			for(int i = 0; i < m; i++){
				String strs[] = sc.next().split(",");
				queue.add(new Path(Integer.parseInt(strs[0]),Integer.parseInt(strs[1]),Integer.parseInt(strs[2])));
			}
			
			int sum = 0;
			UnionFind union = new UnionFind(n);
			
			while(union.num > 1){
				Path p = queue.poll();
				if(!union.find(p.get_from(), p.get_to())){
					union.union(p.get_to(), p.get_from());
					sum += p.get_len()/100-1;
				}
			}
			
			System.out.println(sum);
			
		}
	}
}