Number of Ways to Split a String

Given a string s consisting only of digits '0' and '1', count the number of ways to split the string into three non-empty parts such that the number of ones in each part is the same. Return the number of ways modulo 10^9 + 7.