Data Sufficiency

A nonprofit group organizes its local fundraisers in teams, with each of its L team leaders responsible for D group directors, and each of those D group directors responsible for F fundraisers. If the only three positions on each local team are team leaders, group directors, and fundraisers, and there are more group directors than team leaders, how many team leaders are on the Dallas team?

(1) There are 81 total members on the Dallas team

(2) There are 5 group directors on the Dallas team

My approach

Given informaton:
Total # of members T = L + D + F
D > L

Target question - what is L?

Statement 1:
T = 81

I used the brute approach of testing values and see if I could get only value of L

Let
L = 1
D = 2

This means each Leader will have 2 directors and each director will have 39 fund raisers
How did I reach that?
81 = 1 + 1 + 1 + F + F
2F = 78
F = 39
Now if I take any value of L > 1 I cannot distribute the fund raisers evenly among the Directors
For example
L = 2
D = 3 ( I cannot take D = 2 as it is stated D>L)
81 = 2+3+3+F+F+F
3F = 73 => Not divisible

This would make L=1 as the only value.

So statement 1 should be sufficient.

OA is NOT A