In a school tennis tournament with $ m \ge 2$ participants, each match consists of 4 sets. A player who wins more than half of all sets during a match gets 2 points for this match. A player who wins exactly half of all sets during the match gets 1 point, and a player who wins less than half of all sets gets 0 points. During the tournament, each participant plays exactly one match against each remaining player. Find the least number of participants m for which it is possible that some participant wins more sets than any other participant but obtains less points than any other participant.
To solve this problem, we need to find the minimum number of participants \( m \) such that one participant wins more sets than any other participant but obtains fewer points than any other participant. Let's break down the solution step by step.

1. **Define the Problem:**
   - Each match consists of 4 sets.
   - A player who wins more than half of the sets (i.e., 3 or 4 sets) gets 2 points.
   - A player who wins exactly half of the sets (i.e., 2 sets) gets 1 point.
   - A player who wins less than half of the sets (i.e., 0 or 1 set) gets 0 points.
   - Each participant plays exactly one match against each other participant.

2. **Construct an Example with 6 Participants:**
   - Let's denote the players as \( A, B, C, D, E, F \).
   - We need to construct the matches such that player \( A \) wins more sets but gets fewer points than any other player.

   The matches are as follows:
   - \( A \) vs \( B \): \( A \) wins 4-0.
   - \( A \) vs \( C \): \( A \) wins 4-0.
   - \( A \) vs \( D \): \( A \) loses 1-3.
   - \( A \) vs \( E \): \( A \) loses 1-3.
   - \( A \) vs \( F \): \( A \) loses 1-3.
   - \( B \) vs \( C \): \( B \) wins 3-1.
   - \( B \) vs \( D \): \( B \) wins 3-1.
   - \( C \) vs \( E \): \( C \) wins 3-1.
   - \( C \) vs \( F \): \( C \) wins 3-1.

3. **Calculate Points and Sets Won:**
   - Player \( A \):
     - Wins against \( B \) and \( C \): 4 sets each.
     - Loses to \( D, E, F \): 1 set each.
     - Total sets won: \( 4 + 4 + 1 + 1 + 1 = 11 \).
     - Points: \( 2 + 2 + 0 + 0 + 0 = 4 \).

   - Player \( B \):
     - Wins against \( C, D \): 3 sets each.
     - Loses to \( A \): 0 sets.
     - Total sets won: \( 0 + 3 + 3 = 6 \).
     - Points: \( 0 + 2 + 2 = 4 \).

   - Player \( C \):
     - Wins against \( E, F \): 3 sets each.
     - Loses to \( A, B \): 0 and 1 sets.
     - Total sets won: \( 0 + 1 + 3 + 3 = 7 \).
     - Points: \( 0 + 0 + 2 + 2 = 4 \).

   - Player \( D \):
     - Wins against \( A \): 3 sets.
     - Loses to \( B \): 1 set.
     - Total sets won: \( 3 + 1 = 4 \).
     - Points: \( 2 + 0 = 2 \).

   - Player \( E \):
     - Wins against \( A \): 3 sets.
     - Loses to \( C \): 1 set.
     - Total sets won: \( 3 + 1 = 4 \).
     - Points: \( 2 + 0 = 2 \).

   - Player \( F \):
     - Wins against \( A \): 3 sets.
     - Loses to \( C \): 1 set.
     - Total sets won: \( 3 + 1 = 4 \).
     - Points: \( 2 + 0 = 2 \).

4. **Verify the Conditions:**
   - Player \( A \) wins more sets (11) than any other player.
   - Player \( A \) has fewer points (4) than any other player.

Thus, the minimum number of participants \( m \) for which it is possible that some participant wins more sets than any other participant but obtains fewer points than any other participant is 6.

The final answer is \( \boxed{6} \).